Large sets containing no copies of a given infinite sequence
From MaRDI portal
Publication:6657469
DOI10.2140/apde.2025.18.93MaRDI QIDQ6657469
Mihail N. Kolountzakis, Effie Papageorgiou
Publication date: 6 January 2025
Published in: Analysis \& PDE (Search for Journal in Brave)
Fractals (28A80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Full dimensional sets without given patterns
- A Szemerédi type theorem for sets of positive density in \(\mathbb R^k\)
- Unsolved problems in geometry
- Large sets avoiding patterns
- Distance sets corresponding to convex bodies
- Sets of large dimension not containing polynomial configurations
- Construction of one-dimensional subsets of the reals not containing similar copies of given patterns
- The Scottish Book
- On a Problem of Erdos on Sequences and Measurable Sets
- Large Sets Avoiding Rough Patterns
- Plane Sets with Positive Density at Infinity Contain all Large Distances
- Large Sets not Containing Images of a Given Sequence
- On sets of integers containing k elements in arithmetic progression
- Infinite Patterns that can be Avoided by Measure
- A visit to the Erdös problem
- Salem Sets with No Arithmetic Progressions
- Large sets avoiding linear patterns
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Partition of Space
- Large subsets of Euclidean space avoiding infinite arithmetic progressions
- On a topological Erdős similarity problem
- Large sets avoiding Infinite arithmetic / geometric progressions
This page was built for publication: Large sets containing no copies of a given infinite sequence
