Papers
Topics
Authors
Recent
Search
2000 character limit reached

Arithmetic progressions in polynomial orbits

Published 7 Mar 2024 in math.NT | (2403.04397v1)

Abstract: Let $f$ be a polynomial with integer coefficients whose degree is at least 2. We consider the problem of covering the orbit $\operatorname{Orb}_f(t)={t,f(t),f(f(t)),\cdots}$, where $t$ is an integer, using arithmetic progressions each of which contains $t$. Fixing an integer $k\ge 2$, we prove that it is impossible to cover $\operatorname{Orb}_f(t)$ using $k$ such arithmetic progressions unless $\operatorname{Orb}_f(t)$ is contained in one of these progressions. In fact, we show that the relative density of terms covered by $k$ such arithmetic progressions in $\operatorname{Orb}_f(t)$ is uniformly bounded from above by a bound that depends solely on $k$. In addition, the latter relative density can be made as close as desired to $1$ by an appropriate choice of $k$ arithmetic progressions containing $t$ if $k$ is allowed to be large enough.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.