betaFeedback

WorksMathematics

Patterns, Distances, and Structure in Sparse Sets

Abstract

A central theme in modern harmonic analysis, with strong connections to Ramsey theory, is the tension between randomness and structure: to what extent can a "large" set avoid prescribed configurations, and when must such patterns inevitably appear? The answer depends delicately on how size is measured, with notions such as Hausdorff dimension, Fourier dimension, and density leading to strikingly different phenomena. In this mini-course, we explore this theme through two complementary perspectives. On one hand, we study translation-invariant linear patterns, a natural class of Euclidean Ramsey-type configurations. On the other hand, we investigate distance sets of sparse subsets of Euclidean space, which encode metric configurations of pairs of points. Together, these results illustrate a unifying principle: while sparse sets may avoid individual configurations, sufficiently strong analytic or geometric conditions enforce the emergence of Ramsey-type structure. The course will emphasize key ideas, methods, and examples, aiming to provide an accessible entry point to current developments at the interface of harmonic analysis, geometric measure theory, and Euclidean Ramsey theory. Lectures are by Malabika Pramanik.

Introduction

Question 1. When does a set contain a prescribed configuration? In particular, when does largeness force structure to exist? Conversely, how large can a set be while still avoiding a specified pattern?

The primary aim of these lectures is to provide some partial answers to these questions, both in the positive and negative. This problem is a central one in fractal geometry, but it’d be remiss to not point out that this is a recurring theme in mathematics: sets that are large cannot be completely arbitrary.

  • If a graph is large enough, certain subgraphs must exist within it.

  • If E⊂NE \subset\mathbb{N} is dense, EE contains arbitrarily long arithmetic progressions (see Theorem 3).

  • If a measurable set E⊂RnE \subset\mathbb{R}^{n} has positive Lebesgue measure, EE contains an affine copy of every finite point configuration (see Theorem 5).

Let us now carefully define what we mean by a configuration and size.

Definition 2. A configuration, or pattern, is a prescribed geometric or algebraic set.

For instance, one can consider the following patterns:

  • The vertices of an equilateral triangle or a square.

  • A 3-term arithmetic progression (AP) of the form {x−r,x,x+r}\{x-r,x,x+r\} for some r≠0r\ne0.

  • Algebraic solutions to an equation, e.g. {x1,…,xk}\{x_1,\ldots,x_k\} such that P(x1,…,xk)=0P(x_1,\ldots,x_k)=0 for some polynomial PP.

In this lecture series, we will be exploring when large sets must have or can avoid such patterns. But what do we mean by a “large” set? There are many possible notions of size one could consider, such as positive Lebesgue measure, positive upper density, dimension, and many more. For the most part we will focus our attention to different notions of dimension, but before let us start with a motivating example over the natural numbers.

Theorem 3 (Szemerédi’s Theorem [38]). If E⊆NE\subseteq\mathbb{N} has positive upper density, i.e.

δ‾(E):=lim sup⁡N→∞#(E∩{1,…,N})N>0,\overline{\delta}(E):=\limsup_{N\to\infty}\frac{\#(E\cap\{1,\ldots,N\})}{N}>0,

then for all k≥3k\ge3, EE contains a kk-term arithmetic progression. That is, EE contains a collection of points of the form {a,a+d,a+2d,…,a+(k−1)d}\{a,a+d,a+2d,\ldots,a+(k-1)d\} for some d≠0d\ne0.

Using the language we were using before, this shows that if EE is large in the sense of having positive upper density, it must have some structure in the sense of having arbitrarily long arithmetic progressions. Equally important to Szemerédi’s theorem are results in the opposite direction. Take, for instance, the following result of Salem–Spencer and Behrend:

Theorem 4 ([35] [1]). For all NN sufficiently large, there exists BN⊆{0,1,…,N−1}B_N\subseteq\{0,1,\ldots,N-1\} with #BN≥N1−o(1)\#B_N\ge N^{1-o(1)} such that BNB_N avoids 3-term arithmetic progressions.

Our interest is to explore analogues of these results in Euclidean space (some of which utilize such discrete statements, see Theorem 20). To this end, we must first state Steinhaus’ theorem, whose proof was covered in Kovač’s lectures at the same summer school (see here).

Theorem 5 (Steinhaus’ Theorem [37]). Every set of positive Lebesgue measure in Rn\mathbb{R}^n contains an affine copy of every finite set. That is, given E⊂RnE\subset\mathbb{R}^n with ∣E∣>0|E|>0 and any finite set of points P⊂RnP\subset\mathbb{R}^n, there exists an affine copy of PP within EE.

This is a rigidity statement: every positive measure set must necessarily contain any finite point configuration (up to an affine transformation). Moreover, given Steinhaus’ theorem, we necessarily turn our attention to structure within measure zero sets. Still, we will need a corresponding notion of size. As such, we now define Hausdorff dimension.

Hausdorff Dimension

Hausdorff dimension will be defined using a family of measures that serve as a fractal analogue (and in fact, generalization) of Lebesgue measure.

Definition 6 (Hausdorff measure and dimension). Let (X,d)(X,d) be a separable metric space, E⊂XE\subset X, and δ>0\delta>0. Then, we define

  • the ss-dimensional Hausdorff content at scale δ\delta via

Hδs(E)=inf⁡{∑iris:E⊆⋃Bi such that ri:=diam⁡(Bi)<δ},\mathcal{H}_{\delta}^{s}(E)=\inf\left\{\sum_i r_i^s:E\subseteq\bigcup B_i\text{ such that }r_i:=\operatorname{diam}(B_i)<\delta\right\},
  • the ss-dimensional Hausdorff measure of EE as Hs(E)=lim⁡δ↘0Hδs(E)\mathcal{H}^{s}(E)=\lim_{\delta\searrow0}\mathcal{H}_{\delta}^{s}(E), and

  • the Hausdorff dimension of EE as

dim⁡HE=inf⁡{s:Hs(E)=0}=sup⁡{s:Hs(E)=∞}.\dim_{\mathrm{H}}E=\inf\{s:\mathcal{H}^{s}(E)=0\}=\sup\{s:\mathcal{H}^{s}(E)=\infty\}.

Remark 7. Note that separability is used to ensure that an infimal countable covering can be obtained in the definition of Hδs\mathcal{H}_{\delta}^{s}.

One can directly check that when X=RnX = \mathbb{R}^{n}, the Hn\mathcal{H}^{n}-measure of EE agrees with its Lebesgue measure. Strictly speaking, this is true up to appropriate dimensional constants that should be put into the definition of Hs\mathcal{H}^{s} so that the unit cube has volume 1. However, this is unimportant from the perspective of defining Hausdorff dimension.

Exercise 8. Show that if E⊂RnE \subset\mathbb{R}^{n} is measurable and Hn(E)>0\mathcal{H}^{n}(E) > 0, then dim⁡HE=n\dim_{\mathcal{H}} E = n. Moreover, convince yourself that given a set E⊂RnE \subset\mathbb{R}^{n} with dim⁡E<n\dim E < n, Hn(E)=0\mathcal{H}^{n}(E) = 0.

Exercise 9. Show that dim⁡H(Q)=0\dim_{\mathcal{H}}(\mathbb{Q}) = 0. Moreover, generalize this to any countable set.

To see that Hausdorff dimension is well-defined, note the following proposition (depicted pictorially in Figure 1).

Figure 1. A depiction of Hs(E)\mathcal{H}^{s}(E), whose transition point is dim⁡HE\dim_{\mathcal{H}} E.

Proposition 10. Let (X,d)(X,d) be a metric space, E⊂XE \subset X, and 0≤s<t<∞0 \le s < t < \infty. Then,

  • If Hs(E)<∞\mathcal{H}^{s}(E) < \infty, then Ht(E)=0\mathcal{H}^{t}(E) = 0.

  • If Ht(E)>0\mathcal{H}^{t}(E) > 0, then Hs(E)=∞\mathcal{H}^{s}(E) = \infty.

Proof. Let δ>0\delta> 0 and let E⊂⋃BiE \subset\bigcup B_i with diam⁡(Bi)≤δ\operatorname{diam}(B_i) \le\delta. Then, by definition,

∑idiam⁡(Bi)t≤∑iδt−sdiam⁡(Bi)s.\sum_i \operatorname{diam}(B_i)^t \le\sum_i \delta^{t-s}\operatorname{diam}(B_i)^s.

Taking infimum, it follows that

Hδt(E)≤δt−sHδs(E).\mathcal{H}_{\delta}^{t}(E) \le\delta^{t-s}\mathcal{H}_{\delta}^{s}(E).

The result follows immediately from noting δt−s→0\delta^{t-s} \to0 as δ↘0\delta\searrow0.

Hausdorff dimension agrees with other reasonable notions of topological dimension. For instance, the Hausdorff dimension of a curve is 1, and that of a surface is 2. However, Hausdorff dimension can also take non-integer values.

Example 11. The classical middle thirds Cantor set, C1/3C_{1/3}, has Lebesgue measure zero and Hausdorff dimension log⁡2log⁡3\frac{\log2}{\log3}.

Exercise 12. Sketch a proof of Example 11 by considering what the minimal covering in H3−ks(C1/3)\mathcal{H}_{3^{-k}}^{s}(C_{1/3}) should be for k≥1k \ge1 and arbitrary ss.

Exercise 13. Based on the above example, use a Cantor-like construction to construct sets of Hausdorff dimension log⁡jlog⁡k\frac{\log j}{\log k} for j,k≥2j,k \ge2.

Exercise 14. Show that for any countable collection of Borel sets Ei⊂RnE_i \subset\mathbb{R}^n,

dim⁡H⋃iEi=sup⁡idim⁡HEi.\dim_{\mathrm{H}} \bigcup_i E_i = \sup_i \dim_{\mathrm{H}} E_i.

Using that the Cantor sets in Exercise 13 have Lebesgue measure 0 by Exercise 8, construct a set E⊂R1E \subset\mathbb{R}^1 with null Lebesgue measure such that dim⁡HE=1\dim_{\mathrm{H}} E = 1. Generalize this to Rn\mathbb{R}^n.

The above definition of Hausdorff dimension can be quite difficult to use in practice; requiring finding families of infimal coverings of a set. To this end, we note Frostman’s lemma, which will be of more practical use throughout these lectures.

Theorem 15 (Frostman’s lemma, cf. [27 Theorem 8.8]). Given E⊂RnE \subset\mathbb{R}^n Borel, we have

dim⁡H(E)=sup⁡{s∈[0,n]:∃ a probability measure μ, supp⁡(μ)⊂E, sup⁡x∈Rn,r>0μ(B(x,r))rs<∞}.\dim_{\mathrm{H}}(E) = \sup\left\{s \in[0,n] : \exists\ \text{a probability measure } \mu,\ \operatorname{supp}(\mu) \subset E,\ \sup_{x \in\mathbb{R}^n,r>0} \frac{\mu(B(x,r))}{r^s} < \infty\right\}.

Such a measure is called a Frostman measure.

One may reasonably ask what such a measure μ\mu has to do with the geometry of our set EE. It is worth thinking about what this (heuristically) implies about the number of δ\delta-balls needed to cover EE for sufficiently small δ\delta. It may help to think about this when EE is a singleton, and thus μ\mu must be the Dirac delta measure.

We are now able to revise our original Question 1.

Question 16. Must a set of large Hausdorff dimension contain a prescribed configuration?

To this end, let us state two results of this flavor.

Theorem 17 (Keleti [19, 20]). Given three points P={x,y,z}P = \{x,y,z\} (in fact, any finite set of points), there exists E⊂[0,1]E \subset[0,1] of full Hausdorff dimension (i.e. dim⁡HE=1\dim_{\mathrm{H}} E = 1) avoiding all affine copies of PP.

Theorem 18 (Máthé [25]). There exists a compact set E⊂[0,1]E \subset[0,1] with dim⁡H(E)=0\dim_{\mathrm{H}}(E) = 0 containing an affine copy of every finite set.

Remark 19. Note that these results imply that the answer to Question 16 is, in general, no.

The above two results are flexibility statements: A set can be large or small and contain/not contain a prescribed configuration. Throughout these lectures, we will try to highlight the tension between rigidity and flexibility results.

A Set Avoiding 3-APs

Motivated by Theorem 17, we construct a set of full Hausdorff dimension avoiding 3-term APs. In § 1.3, we work on many more such constructions.

Theorem 20. There exists a set E⊂[0,1]E \subset[0,1] of full Hausdorff dimension such that EE avoids all 3-term arithmetic progressions.

We will demonstrate Theorem 20 through two telling but different methodologies.

Method 1: Cantor Constructions: The Cantor philosophy behind Method 1 is to construct a nested sequence of sets where some intervals are retained or removed at each scale. We will do so in a way that gives large Hausdorff dimension (which will follow from which intervals are retained), while still avoiding this pattern (which will follow from which intervals are removed). As stated previously, our set will be constructed iteratively. Let E0=[0,1]E_0=[0,1]. We will break E0E_0 into 10N110N_1 intervals of length 110N1\frac{1}{10N_1} avoiding 3-term arithmetic progressions at that scale. In particular, given N1N_1 sufficiently large and BN1B_{N_1} as in Theorem 4, let

E1=⋃j1{10j110N1+[0,110N1]:j1∈BN1}.E_1=\bigcup_{j_1}\left\{\frac{10j_1}{10N_1}+\left[0,\frac{1}{10N_1}\right]:j_1\in B_{N_1}\right\}.

Note that while E1E_1 clearly contains 3-APs (as it contains intervals), by our construction any such AP must lie in exactly one of the 110N1\frac{1}{10N_1} intervals in E1E_1. More generally, we will let EkE_k be obtained by decomposing every basic interval of Ek−1E_{k-1} into 10Nk10N_k intervals of length 110Nk\frac{1}{10N_k} equal pieces, and putting a copy of the Behrend set (10BNk)(10B_{N_k}) within it. Finally, we let E=⋂EkE=\bigcap E_k.

Construction of the Cantor set

Figure 2. The construction in Method 1 with Nk=5N_k=5 and BNk={0,1,3,4}B_{N_k}=\{0,1,3,4\}, which is 3-AP free. Iterating gives E=⋂EkE=\bigcap E_k.

Remark 21. Here, one can choose

References

  1. [22]Izabella Łaba and Malabika Pramanik. “Arithmetic Progressions in Sets of Fractional Dimension”. In: Geometric and Functional Analysis 19.2 (2009), pp. 429–456. ISSN: 1420-8970. DOI: 10.1007/s00039-009-0003-9. URL: http://dx.doi.org/10.1007/s00039-009-0003-9.
  2. [23]Yiyu Liang and Malabika Pramanik. “Fourier dimension and avoidance of linear patterns”. In: Advances in Mathematics 399 (2022), p. 108252. ISSN: 0001-8708. DOI: https://doi.org/10.1016/j.aim.2022.108252. URL: https://www.sciencedirect.com/science/article/pii/S0001870822000688.
  3. [24]Russell Lyons. “Seventy Years of Rajchman Measures”. In: The Journal of Fourier Analysis and Applications. CRC Press, Mar. 2020, pp. 363–377. ISBN: 9780429332838. DOI: 10.1201/9780429332838-22. URL: http://dx.doi.org/10.1201/9780429332838-22.
  4. [25]András Máthé. “Covering the real line with translates of a zero-dimensional compact set”. In: Fundamenta Mathematicae 213 (2011), pp. 213–219. URL: https://api.semanticscholar.org/CorpusID:32865628.DOI
  5. [26]András Máthé. “Sets of large dimension not containing polynomial configurations”. In: Advances in Mathematics 316 (2017), pp. 691–709. ISSN: 0001-8708. DOI: https://doi.org/10.1016/j.aim.2017.01.002. URL: https://www.sciencedirect.com/science/article/pii/S0001870817300178.
  6. [27]Pertti Mattila. Geometry of Sets and Measures in Euclidean Spaces: Fractals and Rectifiability. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1995.
  7. [28]Pertti Mattila. “Spherical averages of Fourier transforms of measures with finite energy; dimensions of intersections and distance sets”. In: Mathematika 34.2 (1987), pp. 207–228. DOI: 10.1112/S0025579300013462.DOI
  8. [29]Pertti Mattila and Per Sjölin. “Regularity of distance measures and sets”. In: Mathematische Nachrichten 204 (1999), pp. 157–162.DOI
  9. [30]Eyvindur Ari Palsson and Francisco Romero Acosta. “A Mattila–Sjölin theorem for triangles”. In: Journal of Functional Analysis 284.6 (2023), p. 109814. ISSN: 0022-1236. DOI: https://doi.org/10.1016/j.jfa.2022.109814. URL: https://www.sciencedirect.com/science/article/pii/S0022123622004347.
  10. [31]Eyvindur Ari Palsson and Francisco Romero Acosta. “A Mattila–Sjölin theorem for simplices in low dimensions”. In: Mathematische Annalen 391.1 (2024), pp. 1123–1146. ISSN: 1432-1807. DOI: 10.1007/s00208-024-02948-z. URL: http://dx.doi.org/10.1007/s00208-024-02948-z.
  11. [32]Malabika Pramanik and K.S. Senthil Raani. “Distances in sparse sets of large Hausdorff dimension”. In: Advances in Mathematics 486 (Feb. 2026), p. 110752. ISSN: 0001-8708. DOI: 10.1016/j.aim.2025.110752. URL: http://dx.doi.org/10.1016/j.aim.2025.110752.
  12. [33]Alex Rice. “Sets in ℝ^d with slow-decaying density that avoid an unbounded collection of distances”. In: Proceedings of the American Mathematical Society 148.2 (2019), pp. 523–526. ISSN: 0002-9939. DOI: 10.1090/proc/14802. URL: http://dx.doi.org/10.1090/proc/14802.
  13. [34]K. F. Roth. “On Certain Sets of Integers”. In: Journal of the London Mathematical Society s1-28.1 (1953), pp. 104–109. ISSN: 0024-6107. DOI: 10.1112/jlms/s1-28.1.104. URL: http://dx.doi.org/10.1112/jlms/s1-28.1.104.
  14. [35]R. Salem and D. C. Spencer. “On Sets of Integers Which Contain No Three Terms in Arithmetical Progression”. In: Proceedings of the National Academy of Sciences 28.12 (1942), pp. 561– 563. ISSN: 1091-6490. DOI: 10.1073/pnas.28.12.561. URL: http://dx.doi.org/10.1073/pnas.28.12.561.
  15. [36]Pablo Shmerkin. “Salem Sets with No Arithmetic Progressions”. In: International Mathematics Research Notices (2016), pp. 1921–1941. ISSN: 1687-0247. DOI: 10.1093/imrn/rnw097. URL: http://dx.doi.org/10.1093/imrn/rnw097.
  16. [37]Hugo Steinhaus. “Sur les distances des points dans les ensembles de mesure positive”. In: Fundamenta Mathematicae 1.1 (1920), pp. 93–104. ISSN: 1730-6329. DOI: 10.4064/fm-1-1-93-104. URL: http://dx.doi.org/10.4064/fm-1-1-93-104.
  17. [38]Endre Szemerédi. “On sets of integers containing k elements in an arithmetic progression”. In: Acta Arithmetica 27 (1975), pp. 199–245. ISSN: 1730-6264. DOI: 10.4064/aa-27-1-199-245. URL: http://dx.doi.org/10.4064/aa-27-1-199-245.
  18. [39]Terence Tao. Math 254B (Spring 1999): Restriction Theorems and Applications. 1999.
  19. [40]Jonathan Tidor, Hung-Hsun Hans Yu, and Dmitrii Zakharov. “The Erdős distinct distances problem in ℝ³”. In: arXiv preprint arXiv:2608.14454 (2026).

Paper details

vlnc:W_565y4t7y
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents