Integer Cantor Sets: Arithmetic Combinatorial Properties
Alex Burgin, Anastasios Fragkos, Michael T. Lacey, Dario Mena, Maria Carmen Reguera
TL;DR
The paper investigates arithmetic-ergodic properties of classical integer Cantor sets $\mathcal{C}_{b,D}$, introducing and analyzing the digit-structure-driven phenomena that govern distribution and recurrence. It proves polynomial uniform distribution for pairs $(k_n, s_b(k_n))$ on $[0,1]^2$, studies modular (mod $q$) distributions of $k_n$ and $s_b(k_n)$, and establishes mean ergodic theorems along Cantor sequences. By connecting digit-set geometry to additive-energy conditions, it provides criteria for van der Corput and intersective properties with power savings and derives sufficient conditions for Poissonian pair correlations for almost all shifts $\alpha$. The results highlight a rich interplay between combinatorial digit constraints, modular distribution, and ergodic-theoretic limits, with implications for recurrence and distribution along sparse digit-restricted sets.
Abstract
Cantor sets of integers have a rich set of arithmetic combinatorial properties. We consider classical Cantor sets, with a base and a fixed set of allowed digits. For such sets, we (a) give examples of such sets that satisfy the intersective property with power savings (b) characterize uniform distribution, (c) establish polynomial mean ergodic theorems and (d) study metric pair correlation of Cantor sets.
