Pith.

Classical Analysis and ODEs · arXiv:2611.17198 v1 · submitted 12 Nov 2026 · 40 references

Patterns, Distances, and Structure in Sparse Sets

Paige Bright

The paper says

“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?”

more of the abstract

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.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

No verdict was given on this paper.

the referee pass did not run

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 40 references say.

What would settle it

Independently check whether the choice ϵ₀ ≤ 1/L in the proof of Theorem 73 can be made uniform. Specifically, for a given C₁, C₂, s, compute the minimal L required by the inequality C₀ 2^{−κL} ≤ c*/2 (which depends on J_{s,θ}(µ) and J_{u,1−θ/2}(µ)). Then verify that for every measure µ satisfying the Frostman bound with that ϵ₀ and the Fourier decay |µ̂(ξ)| ≤ C₂|ξ|^{−s/2}, the same L works. If there exists a measure meeting the hypotheses for which the required L forces ϵ₀ < 0 (i.e. the Frostman exponent would have to exceed 1), then the argument is not salvageable without additional assumptions.

from the skeptic's reading

How the review went

3 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader no verdict given confidence moderate
  2. Skeptic partly agrees 10 s · 29,199 tokens read, 813 written
  3. Editor wrote the review in brief 9 s · 30,220 tokens read, 765 written

Not run on this paper: the referee, the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

This is a set of lecture notes from a mini-course by Malabika Pramanik, written up by Paige Bright. It is a survey, not a research preprint. The notes cover a lot of ground: Hausdorff and Fourier dimension, constructions avoiding linear patterns (Keleti, Máthé, Liang–Pramanik), distance set problems (Falconer, Mattila–Sjölin, Pramanik–Raani), and a final section on recent 3-AP results by de Orellana and Krause. The exposition is generally clear and the proofs that are reproduced are mostly faithful. The notes serve a real purpose: they give an accessible entry point to an active area, with exercises and worked constructions.

What is actually new? Very little. The notes contribute original write-ups of a few proofs (Proposition 26, Lemma 28, Theorem 20, part of Theorem 38, Theorem 60) but every theorem is attributed to prior published work. The value is pedagogical, not research.

Where are the soft spots? The main one is in §4, which discusses the de Orellana–Krause results. The sole reference [21] is an arXiv preprint (2508.04680) listed as 2026, i.e. not yet peer-reviewed. The proof sketch in §4 imports this unpublished argument. More critically, the sketch's final step fixes the Fourier cutoff scale L first, then demands the Frostman exponent ϵ₀ ≤ 1/L so that the low-pass approximation fL behaves like a bounded density at scale 2−L. The notes acknowledge at b367 and b393 that ϵ₀ must be small enough, but they do not resolve the dependence: the existence of a single ϵ₀ that works for all measures satisfying the stated conditions is asserted but not derived. If the Fourier-spectrum conditions do not force ϵ₀ to be that small, the lower bound on Λ(fL) collapses and the proof fails. This is a genuine gap in the exposition, though it may be fixable in the original paper.

A minor issue: the write-up of Proposition 26 uses n = floor(ln N) with a pigeonhole inequality that does not close for bounded d, requiring the standard Behrend parameter tradeoff to reach N1−o(1). Since the underlying result is published [23, Prop 4.2], this is an exposition gap, not a refutation.

Who is this for? Graduate students or researchers new to the area who want a guided tour of the main ideas. The notes are well-suited for a reading group or as supplementary material for a course.

Recommendation: This is a survey, not a research paper. It does not claim a new result. If submitted as a research article, it should be desk rejected. If submitted as an expository article or lecture notes, it could be published after the de Orellana–Krause section is revised to either cite the published version (once available) or provide a self-contained proof that resolves the parameter-order issue. I would not send it to peer review as a research paper, but I would accept it as an expository piece with revisions.

The strongest objection

The notes present Theorem 71 (de Orellana–Krause) as a published result, but the only reference [21] is an arXiv preprint (2508.04680) listed as 2026, i.e. not yet peer-reviewed. The proof sketch in §4 is therefore importing an unpublished argument. More critically, the sketch's final step (b433–b437) fixes the Fourier cutoff scale L first, then demands ϵ₀ ≤ 1/L so that the low-pass approximation f_L behaves like a bounded density at scale 2^{-L}. This order of choices means the Frostman exponent 1−ϵ₀ is required to be extremely close to 1, with the closeness depending on L, which itself depends on the Fourier-spectrum constants J_{s,θ}(µ) and J_{u,1−θ/2}(µ). The notes do not verify that such an ϵ₀ can be chosen simultaneously for all measures satisfying the stated conditions; the existence of a single ϵ₀ that works for all C₁, C₂, s is asserted but not derived. If the Fourier-spectrum conditions do not force ϵ₀ to be that small, the lower bound on Λ(f_L) collapses and the proof fails. The notes acknowledge at b367 and b393 that ϵ₀ must be small enough, but they do not resolve the dependence.

The reader's weakest_assumption correctly identifies the quantified Frostman condition as load-bearing, but frames it as a generic sensitivity to ϵ₀. The stress-test reveals a more specific structural issue: the order of quantifiers in the proof sketch (choose L first, then ϵ₀ ≤ 1/L) creates a dependence that is not obviously satisfiable under the stated hypotheses. The notes themselves flag the need for ϵ₀ small (b367, b393) and the non-negativity issue (b401, b424), but do not address the circularity. Because the underlying result is unpublished and the sketch is acknowledged as a sketch, the concern is about the completeness of the argument as presented, not about the truth of the theorem. The verdict should be CONDITIONAL: the exposition is not self-contained at this point, and a reader cannot verify the proof without access to the unpublished preprint or a resolution of the quantifier order. The concrete test would settle whether the argument can be made uniform; if it cannot, the notes would need to either cite the published version (once available) or supply a corrected argument.

Pith's reading of the paper (a machine's summary, not the authors')

The notes explain a tension in harmonic analysis and fractal geometry. On the flexibility side, sets of full Hausdorff dimension can be built that avoid 3-term arithmetic progressions, or even whole families of translation-invariant linear equations, using Cantor-style constructions built on Behrend's discrete 3-AP-free sets. On the rigidity side, if a set carries a probability measure with enough Fourier decay, patterns start to appear: a set of Fourier dimension above 2/3 must contain a nontrivial solution to an equation of the form (a+b)z = ax + by. The proof uses a configuration measure that counts such solutions, whose positivity is controlled by Fourier decay.

Core claim. The notes present the rigidity half of their theme: any set E in R with Fourier dimension greater than 2/3 must contain a nontrivial solution to an equation (a+b)z = ax + by (Theorem 38, Liang-Pramanik [23]), and any compact set supporting a probability measure with Frostman bound C_1 r^{1-epsilon_0} and Fourier decay C_2 |xi|^{-s/2} for any s>0 contains a 3-term arithmetic progression (Theorem 71, de Orellana-Krause [21]). These are quoted published results, reproduced with proofs or proof sketches in the notes.

The premise it rests on. The de Orellana-Krause results (Theorems 71 and 73) require the Frostman exponent 1-epsilon_0 with epsilon_0 small, and the notes' proof of Theorem 73 fixes the Fourier scale L first, then demands epsilon_0 <= 1/L so that the measure resembles a bounded density at scale 2^{-L} (end of the Theorem 73 sketch, b433, b437). If epsilon_0 is not taken small enough the configuration measure can vanish, a point the notes themselves stress at b367 and b393. This quantified Frostman condition is the load-bearing premise: the lower bound on the main term, and hence the existence of the 3-AP, depends on it.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

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.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-14

The authors' main claim, as the classifier picked it out 1.00

“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.”

How the main claim is stated: asserted 0.82

What the abstract itself states, as probabilities: claims first 0.02 · states limitation 0.23 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.03 · compares with prior results 0.07 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
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? background 1.00 0.04 0.06 asserted 0.97
The answer depends delicately on how size is measured, with notions such as Hausdorff dimension, Fourier dimension, and density leading to strikingly different phenomena. background 1.00 0.07 0.04 asserted 1.00
In this mini-course, we explore this theme through two complementary perspectives. contribution 0.75 0.23 0.02 asserted 0.86
On one hand, we study translation-invariant linear patterns, a natural class of Euclidean Ramsey-type configurations. contribution 0.97 0.49 0.03 asserted 0.89
On the other hand, we investigate distance sets of sparse subsets of Euclidean space, which encode metric configurations of pairs of points. contribution 0.98 0.53 0.04 asserted 0.95
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. interpretation 0.98 0.56 0.78 asserted 0.82
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. contribution 0.38 0.10 0.03 asserted 0.51
Lectures are by Malabika Pramanik. background 0.84 0.04 0.01 asserted 0.98

What kind of paper the classifier reports this is: review 0.76 · evidence from proof or derivation 0.70

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-14: 1 request, 6,205 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (3)
Figure 1 of the paper
Figure 1. A depiction of Hs pEq, whose transition point is dimH E. Hausdorff dimension agrees with other reasonable notions of topological dimension. For in￾stance, 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{3, has Lebesgue measure zero and Haus￾dorff dimension log 2 log 3 . Exercise 12. Sketch a proof of Example 11 by considering what the minimal covering in Hs 3´k pC1{3q should be for k ě 1 and arbitrary s
Figure 2 of the paper
Figure 2. The construction in Method 1 with Nk “ 5 and BNk “ t0, 1, 3, 4u, which is 3-AP free. Iterating gives E “ Ş Ek. Remark 21. Here, one can choose 100 ď N1 ď N2 ď . . . growing sufficiently slowly. However, for other similar constructions we will need to be more careful about this choice of Nk. Exercise 22. Given #BN ě N1´op1q , show dimH E “ 1. Moreover, show that E is 3-AP free. There are some immediate pros and cons to Method 1. A big pro is that we can easily convert a discrete example from additive combinatorics into a fractal one with the appropriate dimension. On the other hand
Figure 3 of the paper
Figure 3. A depiction of dimθ F pµq, a non-decreasing, concave, and continuous function in θ P p0, 1s. The Fourier spectrum is a non-decreasing, concave, and continuous in p0, 1s (see

Figures are the authors', reproduced from the paper.

References (40)
  1. [21] Ben Krause and Ana de Orellana. “On Polynomial Progressions Inside Sets of Large Dimen- sion”. In:arXiv preprint arXiv:2508.04680(2026). REFERENCES 29 on PithPith's reviewarXiv
  2. [1] F. A. Behrend. “On Sets of Integers Which Contain No Three Terms in Arithmetical Pro- gression”. In:Proceedings of the National Academy of Sciences32.12 (1946), pp. 331–332.issn: 1091-6490.doi:10.1073/pnas.32.12.331.url:http://dx.doi.org/10.1073/pnas. 32.12.331 on Pithdoi:10.1073/pnas.32.12.331.url:http://dx.doi.org/10.1073/pnas
  3. [2] Tainara Borges, Yumeng Ou, and Marcus Pasquariello. “From weighted paraboloid restric- tion tok-stars and distance graphs”. In:arXiv preprint arXiv:2607.10574(2026) on PithPith's reviewarXiv
  4. [3] Tainara Borges et al. “Nonempty interior of pinned distance and tree sets”. In:Advances in Mathematics493 (2026), p. 110917.issn: 0001-8708.doi:https://doi.org/10.1016/j. aim.2026.110917.url:https://www.sciencedirect.com/science/article/pii/ S0001870826001398 on Pithdoi:10.1016/j
  5. [4] J. Bourgain. “A Szemerédi type theorem for sets of positive density inR k”. In:Israel Journal of Mathematics54.3 (Oct. 1986), pp. 307–316.issn: 1565-8511.doi:10.1007/bf02764959. url:http://dx.doi.org/10.1007/BF02764959 on Pithdoi:10.1007/bf02764959
  6. [5] Xiumin Du et al. “New improvement to Falconer distance set problem in higher dimen- sions”. In:arXiv preprint arXiv:2309.04103(2023) on PithPith's reviewarXiv
  7. [6] K. J. Falconer.Fractal Geometry: Mathematical Foundations and Applications. Wiley, 2003. 28 REFERENCES on Pith
  8. [7] K. J. Falconer. “On the Hausdorff dimensions of distance sets”. In:Mathematika32.2 (1985), pp. 206–212 on Pith
  9. [8] K. J. Falconer and J. M. Marstrand. “Plane Sets with Positive Density at Infinity Contain all Large Distances”. In:Bulletin of the London Mathematical Society18.5 (1986), pp. 471–474. issn: 0024-6093.doi:10.1112/blms/18.5.471.url:http://dx.doi.org/10.1112/ blms/18.5.471 on Pithdoi:10.1112/blms/18.5.471.url:http://dx.doi.org/10.1112/
  10. [9] Jonathan M. Fraser. “The Fourier spectrum and sumset type problems”. In:Mathematische Annalen390.3 (2024), pp. 3891–3930.issn: 1432-1807.doi:10.1007/s00208-024-02843- 7.url:http://dx.doi.org/10.1007/s00208-024-02843-7 on Pithdoi:10.1007/s00208-024-02843-
  11. [10] Hillel Furstenberg, Yitzchak Katznelson, and Benjamin Weiss. “Ergodic Theory and Con- figurations in Sets of Positive Density”. In:Mathematics of Ramsey Theory. Springer Berlin Heidelberg, 1990, pp. 184–198.isbn: 9783642729058.doi:10.1007/978-3-642-72905- 8_13.url:http://dx.do... on Pithdoi:10.1007/978-3-642-72905-
  12. [11] Loukas Grafakos.Classical Fourier Analysis. Springer New York, 2014.isbn: 9781493911943. doi:10.1007/978-1-4939-1194-3.url:http://dx.doi.org/10.1007/978-1-4939- 1194-3 on Pithdoi:10.1007/978-1-4939-1194-3.url:http://dx.doi.org/10.1007/978-1-4939-
  13. [12] Allan Greenleaf and Alex Iosevich. “On triangles determined by subsets of the Euclidean plane, the associated bilinear operators and applications to discrete geometry”. In:Analysis & PDE5.2 (Aug. 2012), pp. 397–409.issn: 2157-5045.doi:10.2140/apde.2012.5.397. url:http://dx.doi... on Pithdoi:10.2140/apde.2012.5.397
  14. [13] Allan Greenleaf, Alex Iosevich, and Krystal Taylor. “Configuration Sets with Nonempty Interior”. In:The Journal of Geometric Analysis31.7 (2019), pp. 6662–6680.issn: 1559-002X. doi:10.1007/s12220- 019- 00288- y.url:http://dx.doi.org/10.1007/s12220- 019-00288-y on Pithdoi:10.1007/s12220-
  15. [14] Allan Greenleaf, Alex Iosevich, and Krystal Taylor. “Nonempty interior of configuration sets via microlocal partition optimization”. In:Mathematische Zeitschrift306.4 (2024).issn: 1432-1823.doi:10.1007/s00209-024-03466-z.url:http://dx.doi.org/10.1007/ s00209-024-03466-z on Pithdoi:10.1007/s00209-024-03466-z.url:http://dx.doi.org/10.1007/
  16. [15] Allan Greenleaf, Alex Iosevich, and Krystal Taylor. “Onk-point configuration sets with nonempty interior”. In:Mathematika68.1 (2022), pp. 163–190.issn: 2041-7942.doi:10 . 1112/mtk.12114.url:http://dx.doi.org/10.1112/mtk.12114 on Pithdoi:10.1112/mtk.12114
  17. [16] Larry Guth and Nets Katz. “On the Erdős distinct distances problem in the plane”. In:Annals of Mathematics(2015), pp. 155–190 on Pith
  18. [17] Larry Guth et al. “On Falconer’s distance set problem in the plane”. In:Invent. Math.219.3 (2020), pp. 779–830 on Pith
  19. [18] Alex Iosevich. “What is Falconer’s Conjecture?” In:Notices of the American Mathematical Society66.04 (2019), p. 1.issn: 1088-9477.doi:10.1090/noti1843.url:http://dx.doi. org/10.1090/noti1843 on Pithdoi:10.1090/noti1843.url:http://dx.doi
  20. [19] Tamás Keleti. “A 1-dimensional subset of the reals that intersects each of its translates in at most a single point”. In:Real Anal. Exchange24.2 (1998), pp. 843–844.issn: 0147-1937,1930- 1219 on Pith
show 20 more
  1. [20] Tamás Keleti. “Construction of one-dimensional subsets of the reals not containing similar copies of given patterns”. In:Analysis & PDE1.1 (2008), pp. 29–33.url:https://doi. org/10.2140/apde.2008.1.29 on Pithdoi:10.2140/apde.2008.1.29
  2. [22] Izabella Łaba and Malabika Pramanik. “Arithmetic Progressions in Sets of Fractional Di- mension”. In:Geometric and Functional Analysis19.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 on Pithdoi:10.1007/s00039-009-0003-9.url:http://dx.doi.org/10.1007/s00039-009-
  3. [23] Yiyu Liang and Malabika Pramanik. “Fourier dimension and avoidance of linear patterns”. In:Advances in Mathematics399 (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 on Pithdoi:10.1016/j.aim.2022.108252.url:https://www.sciencedirect.com/science/
  4. [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 on Pithdoi:10.1201/9780429332838-22
  5. [25] András Máthé. “Covering the real line with translates of a zero-dimensional compact set”. In:Fundamenta Mathematicae213 (2011), pp. 213–219.url:https://api.semanticscholar. org/CorpusID:32865628 on Pith
  6. [26] András Máthé. “Sets of large dimension not containing polynomial configurations”. In:Ad- vances in Mathematics316 (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 on Pithdoi:10.1016/j.aim.2017.01.002.url:https://www.sciencedirect.com/science/
  7. [27] Pertti Mattila.Geometry of Sets and Measures in Euclidean Spaces: Fractals and Rectifiability. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1995 on Pith
  8. [28] Pertti Mattila. “Spherical averages of Fourier transforms of measures with finite energy; dimensions of intersections and distance sets”. In:Mathematika34.2 (1987), pp. 207–228. doi:10.1112/S0025579300013462 on Pithdoi:10.1112/s0025579300013462
  9. [29] Pertti Mattila and Per Sjölin. “Regularity of distance measures and sets”. In:Mathematische Nachrichten204 (1999), pp. 157–162 on Pith
  10. [30] Eyvindur Ari Palsson and Francisco Romero Acosta. “A Mattila–Sjölin theorem for trian- gles”. In:Journal of Functional Analysis284.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/S0022123... on Pithdoi:10.1016/j.jfa.2022.109814.url:https://www.sciencedirect.com/
  11. [31] Eyvindur Ari Palsson and Francisco Romero Acosta. “A Mattila–Sjölin theorem for sim- plices in low dimensions”. In:Mathematische Annalen391.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 on Pithdoi:10.1007/s00208-024-02948-z.url:http://dx.doi.org/10.1007/
  12. [32] Malabika Pramanik and K.S. Senthil Raani. “Distances in sparse sets of large Hausdorff dimension”. In:Advances in Mathematics486 (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 on Pithdoi:10.1016/j.aim.2025.110752.url:http://dx.doi.org/10.1016/j.aim.2025
  13. [33] Alex Rice. “Sets inR d with slow-decaying density that avoid an unbounded collection of distances”. In:Proceedings of the American Mathematical Society148.2 (2019), pp. 523–526. issn: 0002-9939.doi:10.1090/proc/14802.url:http://dx.doi.org/10.1090/proc/ 14802 on Pithdoi:10.1090/proc/14802.url:http://dx.doi.org/10.1090/proc/
  14. [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 on Pithdoi:10.1112/jlms/s1-28.1.104
  15. [35] R. Salem and D. C. Spencer. “On Sets of Integers Which Contain No Three Terms in Arith- metical Progression”. In:Proceedings of the National Academy of Sciences28.12 (1942), pp. 561– 30 REFERENCES 563.issn: 1091-6490.doi:10.1073/pnas.28.12.561.url:http://dx.doi.org/10. 1073/pn... on Pithdoi:10.1073/pnas.28.12.561.url:http://dx.doi.org/10
  16. [36] Pablo Shmerkin. “Salem Sets with No Arithmetic Progressions”. In:International Mathemat- ics Research Notices(2016), pp. 1921–1941.issn: 1687-0247.doi:10.1093/imrn/rnw097. url:http://dx.doi.org/10.1093/imrn/rnw097 on Pithdoi:10.1093/imrn/rnw097
  17. [37] Hugo Steinhaus. “Sur les distances des points dans les ensembles de mesure positive”. In: Fundamenta Mathematicae1.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 on Pithdoi:10.4064/fm-1-1-
  18. [38] Endre Szemerédi. “On sets of integers containingkelements in arithmetic progression”. In: Acta Arithmetica27 (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 on Pithdoi:10.4064/aa-27-1-199-245
  19. [39] Terence Tao.Math 254B (Spring 1999): Restriction Theorems and Applications. 1999 on Pith
  20. [40] Jonathan Tidor, Hung-Hsun Hans Yu, and Dmitrii Zakharov. “The Erdős distinct distances problem inR 3”. In:arXiv preprint arXiv:2608.14454(2026) on PithPith's reviewarXiv

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment