SearcharxivSearch

arXiv · 2608.14998

Arithmetic-progression gap sets in Cantor sets

Abstract

We address the question of which common differences can arise in arithmetic progressions contained in fractal sets. For a compact set $C\subset\mathbb R$, we investigate not only whether arithmetic progressions occur in $C$, but the full collection of their common differences. More generally, for a finite pattern $P$, we study the set of scales at which affine copies of $P$ appear in $C$. For affine self-similar sets satisfying strong separation, we obtain explicit restrictions on admissible common differences. Specializing to middle-$\varepsilon$ Cantor sets, we prove that the longest arithmetic progression has length four whenever $3-2\sqrt2<\varepsilon\le 1/3$, showing that the maximal progression length drops immediately from six at the critical parameter $\varepsilon=3-2\sqrt2$. We further develop recursive bounds for the sets of admissible common differences and derive explicit blackout intervals, namely ranges of scales for which arithmetic progressions cannot occur. On the positive side, sufficiently thick Cantor sets exhibit the opposite behavior. Combining a refinement of the Hunt-Kan-Yorke construction with the Newhouse Gap Lemma, we prove that every sufficiently small common difference occurs in a three-term arithmetic progression. In particular, if the largest bounded gap of a Cantor set is at most $0.067 diam(C)$ and its thickness is at least $6.96268\ldots$, then every common difference in $(0,0.435 diam(C)]$ occurs in a three-term arithmetic progression contained in $C$. Analogous interval results are obtained for four-term arithmetic progressions and asymmetric three-point patterns.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samantha Sandberg-Clark, Krystal Taylor, Alexia Yavicoli. 2026-08-15. Arithmetic-progression gap sets in Cantor sets. https://arxiv.org/abs/2608.14998

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA