2017
DOI: 10.1093/imrn/rnx261
|View full text |Cite
|
Sign up to set email alerts
|

Dimensions of Sets Which Uniformly Avoid Arithmetic Progressions

Abstract: Abstract. We provide estimates for the dimensions of sets in R which uniformly avoid finite arithmetic progressions. More precisely, we say F uniformly avoids arithmetic progressions of length k ≥ 3 if there is an ε > 0 such that one cannot find an arithmetic progression of length k and gap length ∆ > 0 inside the ε∆ neighbourhood of F . Our main result is an explicit upper bound for the Assouad (and thus Hausdorff) dimension of such sets in terms of k and ε. In the other direction, we provide examples of sets… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 10 publications
(3 reference statements)
0
12
0
Order By: Relevance
“…, x + (k − 1)∆}, for some x ∈ R, that is, a collection of k points each separated from the next by a common distance ∆. We consider the following weakening of the property of containing arithmetic progressions, which was introduced and studied in [110,107]. This definition should be understood as saying that, for arbitrarily large k and arbitrarily small ε > 0, X gets within ε of an arithmetic progression of length k. The fact that ε∆ appears instead of ε is the necessary normalization.…”
Section: Arithmetic Progressionsmentioning
confidence: 99%
See 1 more Smart Citation
“…, x + (k − 1)∆}, for some x ∈ R, that is, a collection of k points each separated from the next by a common distance ∆. We consider the following weakening of the property of containing arithmetic progressions, which was introduced and studied in [110,107]. This definition should be understood as saying that, for arbitrarily large k and arbitrarily small ε > 0, X gets within ε of an arithmetic progression of length k. The fact that ε∆ appears instead of ε is the necessary normalization.…”
Section: Arithmetic Progressionsmentioning
confidence: 99%
“…One may bound the Assouad dimension of a set above in terms of how far away it is from approximating arithmetic progressions of a given length. This is explored in detail in [107]. A quantitative improvement of Theorem 14.1.3 was proved in [113] where the error o(∆) is replaced with O(∆ α ) for any α ∈ (0, 1).…”
Section: Arithmetic Progressionsmentioning
confidence: 99%
“…Also, Hieronymi and Miller have recently used the Assouad dimension to study nondefinability problems relating to expansions in the real number field, see [HM]. There are also connections between the Assouad dimension and problems in arithmetic combinatorics, for example the existence of arithmetic progressions or asymptotic arithmetic progressions, see [FY2,FSY].…”
mentioning
confidence: 99%
“…If a set is Ahlfors-David regular, then the lower, Hausdorff, box and Assouad dimensions all coincide and, as such, our results below apply to a much larger class of sets where Ahlfors-David regularity is weakened to only requiring that either the lower dimension is strictly positive or the Assouad dimension is strictly less than 1. This is natural since, for example, sets with Assouad dimension strictly less than 1 are precisely the sets which uniformly avoid arithmetic progressions [FY18,FSY17], and arithmetic progressions tend to cause the sumset to be small.…”
Section: Resultsmentioning
confidence: 99%