Skip to main content
Cornell University
Learn about arXiv becoming an independent nonprofit.
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arxiv logo > math > arXiv:2011.14531

Help | Advanced Search

arXiv logo
Cornell University Logo

quick links

  • Login
  • Help Pages
  • About

Mathematics > Dynamical Systems

arXiv:2011.14531 (math)
[Submitted on 30 Nov 2020 (v1), last revised 31 Mar 2023 (this version, v2)]

Title:The Furstenberg-Sárközy Theorem and Asymptotic Total Ergodicity Phenomena in Modular Rings

Authors:Vitaly Bergelson, Andrew Best
View a PDF of the paper titled The Furstenberg-S\'ark\"ozy Theorem and Asymptotic Total Ergodicity Phenomena in Modular Rings, by Vitaly Bergelson and Andrew Best
View PDF
Abstract:The Furstenberg-Sárközy theorem asserts that the difference set $E-E$ of a subset $E \subset \mathbb{N}$ with positive upper density intersects the image set of any polynomial $P \in \mathbb{Z}[n]$ for which $P(0)=0$. Furstenberg's approach relies on a correspondence principle and a polynomial version of the Poincaré recurrence theorem, which is derived from the ergodic-theoretic result that for any measure-preserving system $(X,\mathcal{B},\mu,T)$ and set $A \in \mathcal{B}$ with $\mu(A) > 0$, one has $c(A):= \lim_{N \to \infty} \frac{1}{N} \sum_{n=1}^N \mu(A \cap T^{-P(n)}A) > 0.$ The limit $c(A)$ will have its optimal value of $\mu(A)^2$ when $T$ is totally ergodic. Motivated by the possibility of new combinatorial applications, we define the notion of asymptotic total ergodicity in the setting of modular rings $\mathbb{Z}/N\mathbb{Z}$. We show that a sequence of modular rings $\mathbb{Z}/N_m\mathbb{Z}$, $m \in \mathbb{N},$ is asymptotically totally ergodic if and only if $\mathrm{lpf}(N_m)$, the least prime factor of $N_m$, grows to infinity. From this fact, we derive some combinatorial consequences, for example the following. Fix $\delta \in (0,1]$ and a (not necessarily intersective) polynomial $Q \in \mathbb{Q}[n]$ such that $Q(\mathbb{Z}) \subseteq \mathbb{Z}$, and write $S = \{ Q(n) : n \in \mathbb{Z}/N\mathbb{Z}\}$. For any integer $N > 1$ with $\mathrm{lpf}(N)$ sufficiently large, if $A$ and $B$ are subsets of $\mathbb{Z}/N\mathbb{Z}$ such that $|A||B| \geq \delta N^2$, then $\mathbb{Z}/N\mathbb{Z} = A + B + S$.
Comments: 29 pages, update with referee's comments
Subjects: Dynamical Systems (math.DS); Combinatorics (math.CO)
MSC classes: 37A05 (Primary) 11B13 (Secondary)
Cite as: arXiv:2011.14531 [math.DS]
  (or arXiv:2011.14531v2 [math.DS] for this version)
  https://doi.org/10.48550/arXiv.2011.14531
arXiv-issued DOI via DataCite
Journal reference: Journal of Number Theory, Volume 243, 2023, Pages 615-645

Submission history

From: Andrew Best [view email]
[v1] Mon, 30 Nov 2020 03:46:14 UTC (33 KB)
[v2] Fri, 31 Mar 2023 09:52:38 UTC (38 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled The Furstenberg-S\'ark\"ozy Theorem and Asymptotic Total Ergodicity Phenomena in Modular Rings, by Vitaly Bergelson and Andrew Best
  • View PDF
  • TeX Source
view license

Current browse context:

math.DS
< prev   |   next >
new | recent | 2020-11
Change to browse by:
math
math.CO

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • Click here to contact arXiv Contact
  • Click here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status