Height Rigidity for Entire Functions
arXiv:2608.15891
Abstract
We prove that algebraic values of bounded degree and polynomially bounded height are sparse on rational translates of the graph of a transcendental entire function. More precisely, for fixed , , , and for every , only rationals of height at most can satisfy simultaneously and . Consequently, if these bounds hold for every rational of sufficiently large height, then and . As applications, we obtain rigidity results for entire functions taking rational or bounded-degree algebraic values with polynomially controlled arithmetic height. In particular, this excludes the polynomial-denominator scenario that arises naturally in connection with Mahler's problem on Liouville numbers. The proof combines Pila's bounded-degree counting theorem with standard height estimates and a simple geometric analysis of transcendental entire graphs.