José Burgos Gil | Searcharxiv

arXiv2026

Closing the gap around the essential minimum of height functions with linear programming

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.

math.NT↗

arXiv2017

On the essential minimum of Faltings' height

We study the essential minimum of the (stable) Faltings height on the moduli space of elliptic curves. We prove that, in contrast to the Weil height on a projective space and the N{é}ron-Tate height of an abelian variety, Faltings' height takes at least two values that are smaller than its essential minimum. We also provide upper and lower bounds for this quantity that allow us to compute it up to five decimal places. In addition, we give numerical evidence that there are at least four isolated values before the essential minimum. One of the main ingredients in our analysis is a good approximation of the hyperbolic Green function associated to the cusp of the modular curve of level one. To establish this approximation, we make an intensive use of distortion theorems for univalent functions. Our results have been motivated and guided by numerical experiments that are described in detail in the companion files.

math.NT↗