Large sets avoiding linear patterns
From MaRDI portal
Abstract: We prove that for any dimension function with and for any countable set of linear patterns, there exists a compact set with avoiding all the given patterns. We also give several applications and recover results of Keleti, Maga, and M'{a}th'{e}.
Recommendations
Cites work
- A \(1\)-dimensional subset of the reals that intersects each of its translates in at most a single point
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Construction of one-dimensional subsets of the reals not containing similar copies of given patterns
- Equilateral triangles in subsets of \(\mathbb{R}^d\) of large Hausdorff dimension
- Finite configurations in sparse sets
- Full dimensional sets without given patterns
- scientific article; zbMATH DE number 3116749 (Why is no real title available?)
- scientific article; zbMATH DE number 3071148 (Why is no real title available?)
- Large sets avoiding patterns
- On a problem of Erdős on fractal combinatorial geometry
- On Roth's theorem on progressions
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Sets of large dimension not containing polynomial configurations
- Small sets containing any pattern
Cited in
(16)- Large sets avoiding patterns
- Sets of large dimension not containing polynomial configurations
- Patterns in thick compact sets
- Fourier dimension and avoidance of linear patterns
- Intersections of thick compact sets in \(\mathbb{R}^d\)
- Finding Patterns Avoiding Many Monochromatic Constellations
- Full dimensional sets without given patterns
- Infinite Patterns that can be Avoided by Measure
- Small sets containing any pattern
- Sets of full measure avoiding Cantor sets
- Large subsets of Euclidean space avoiding infinite arithmetic progressions
- scientific article; zbMATH DE number 7731180 (Why is no real title available?)
- Large sets avoiding Infinite arithmetic / geometric progressions
- Large sets containing no copies of a given infinite sequence
- Two-point patterns determined by curves
- Fifty years of the Erdős similarity conjecture
This page was built for publication: Large sets avoiding linear patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012086)