Sets of large dimension not containing polynomial configurations
From MaRDI portal
Publication:2012506
DOI10.1016/J.AIM.2017.01.002zbMATH Open1371.28007arXiv1201.0548OpenAlexW1500831531MaRDI QIDQ2012506FDOQ2012506
Publication date: 1 August 2017
Published in: Advances in Mathematics (Search for Journal in Brave)
Abstract: The main result of this paper is the following. Given countably many multivariate polynomials with rational coefficients and maximum degree , we construct a compact set of Hausdorff dimension which does not contain finite point configurations corresponding to the zero sets of the given polynomials. Given a set , we study the angles determined by three points of . The main result implies the existence of a compact set in of Hausdorff dimension which does not contain the angle . (This is known to be sharp if is even.) We show that there is a compact set of Hausdorff dimension which does not contain an angle in any given countable set. We also construct a compact set of Hausdorff dimension for which the set of angles determined by is Lebesgue null. In the other direction, we present a result that every set of sufficiently large dimension contains an angle close to any given angle.
Full work available at URL: https://arxiv.org/abs/1201.0548
Recommendations
- Polynomial configurations in subsets of random and pseudo-random sets
- Polynomial configurations in difference sets
- Large dimensional sets not containing a given angle
- scientific article; zbMATH DE number 1057906
- Bounds for sets with no polynomial progressions
- Large sets with multiplicity
- Sets of large values of correlation functions for polynomial cubic configurations
- Sets and multisets of range uniqueness for polynomials
- Publication:3484825
- Large sets avoiding linear patterns
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Construction of one-dimensional subsets of the reals not containing similar copies of given patterns
- How large dimension guarantees a given angle?
- On the Hausdorff dimensions of distance sets
- Full dimensional sets without given patterns
- The Realization of small Distances in Plane Sets of Positive Measure
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a problem of Erdős on fractal combinatorial geometry
- Large dimensional sets not containing a given angle
Cited In (15)
- Large sets avoiding linear patterns
- Patterns in thick compact sets
- A framework for constructing sets without configurations
- Fourier dimension and avoidance of linear patterns
- Finite configurations in sparse sets
- How large dimension guarantees a given angle?
- Full dimensional sets without given patterns
- Large subsets of Euclidean space avoiding infinite arithmetic progressions
- Title not available (Why is that?)
- Large Sets Avoiding Rough Patterns
- Intersections of thick compact sets in \(\mathbb{R}^d\)
- Large sets containing no copies of a given infinite sequence
- Small sets containing any pattern
- On some properties of sparse sets: a survey
- An Explicit Solution for a Multimarginal Mass Transportation Problem
This page was built for publication: Sets of large dimension not containing polynomial configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012506)