Uniformly bounded geometric progressions in translated integer polynomial ranges
Uniformly bounded geometric progressions in translated integer polynomial ranges
Let be a polynomial over the integers. For each integer , define
A geometric progression of length is a sequence of terms with a common ratio. Geometric-progression conjecture. There is a bound such that, for every , the range contains no geometric progression of length ; equivalently, .
The source presents this as a weak form of a uniformity conjecture that would imply the additive statement in the integer case. The authors say they were unable to prove even the corresponding assertion that an integer polynomial of degree at least two has no arbitrarily long arithmetic progressions in its integer range.
Sources & referencesView supporting material
Primary source
Jozsef Solymosi, “Expanding Polynomials over the rationals”, arXiv:1212.3365 (2012).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.