arXiv · 2601.18978
Closing the gap around the essential minimum of height functions with linear programming
Abstract
For many common height functions, it is notoriously hard to compute the essential minimum. Nevertheless there are two classical methods, one giving lower bounds and the other giving upper bounds. In this paper, we show that the two methods are actually dual to each other in the sense of linear programming. The main theorem is that they satisfy strong duality, which closes the gap around the essential minimum from both ends. As applications we prove that this essential minimum can be realized by a generic sequence of algebraic integers, and that if the associated Green function is computable then this essential minimum is a computable real number.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
José Burgos Gil, Ricardo Menares, Binggang Qu, Martín Sombra. 2026-01-26. Closing the gap around the essential minimum of height functions with linear programming. https://arxiv.org/abs/2601.18978
Cite the original work for its findings. Save a collection to share your selection of sources.