Answers are grounded in this paper and cite their sources.
This paper is concerned with the estimation of the number of integer solutions to exponential equations in several variables, over function fields. We develop a method which sometimes allows to replace known exponential bounds with polynomial ones. More generally, we prove a counting result (Thm. 1) on the integer points where given exponential terms become linearly dependent over the constant field. Several applications are given to equations (Cor. 1) and to the estimation of the number of equal values of certain pairs of recurrence sequences (Cor. 2). In particular we substantially sharpen (Cor. 3) recent bounds for the number of integer solutions ( m , n ) of G m ( P ( X ) ) = c m , n G n ( X ) , where G n is a recurrence of polynomials, P is a polynomial and c m , n is a variable constant. Finally, we estimate the number of solutions to an S -unit type equation in two variables (Cor. 4), improving on known bounds.
No takes yet. Share an insight, caveat, or question.
Umberto Zannier (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: