Large sets avoiding patterns
From MaRDI portal
Abstract: We construct subsets of Euclidean space of large Hausdorff dimension and full Minkowski dimension that do not contain nontrivial patterns described by the zero sets of functions. The results are of two types. Given a countable collection of -variate vector-valued functions satisfying a mild regularity condition, we obtain a subset of of Hausdorff dimension that avoids the zeros of for every . We also find a set that simultaneously avoids the zero sets of a family of uncountably many functions sharing the same linearization. In contrast with previous work, our construction allows for non-polynomial functions as well as uncountably many patterns. In addition, it highlights the dimensional dependence of the avoiding set on , the number of input variables.
Recommendations
- Large Sets Avoiding Rough Patterns
- Large sets avoiding linear patterns
- Large sets avoiding Infinite arithmetic / geometric progressions
- Avoiding a pair of patterns in multisets and compositions
- Patterns in random permutations avoiding some sets of multiple patterns
- Large Finite Sets
- Large sets with multiplicity
- Large sets avoiding affine copies of infinite sequences
- Pattern avoidance in compositions and multiset permutations
- Pattern avoidance in ordered set partitions
Cites work
- A group-theoretic viewpoint on Erdös-Falconer problems and the Mattila integral
- Arithmetic progressions in sets of fractional dimension
- Construction of one-dimensional subsets of the reals not containing similar copies of given patterns
- Finite chains inside thin subsets of \(\mathbb{R}^d\)
- Finite configurations in sparse sets
- Fourier transforms of measures and algebraic relations on their supports
- Full dimensional sets without given patterns
- How large dimension guarantees a given angle?
- scientific article; zbMATH DE number 914851 (Why is no real title available?)
- On necklaces inside thin subsets of \(\mathbb{R}^d\)
- On polynomial configurations in fractal sets
- On sets of integers containing k elements in arithmetic progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On triangles determined by subsets of the Euclidean plane, the associated bilinear operators and applications to discrete geometry
Cited in
(20)- On sets containing an affine copy of bounded decreasing sequences
- Fourier dimension and avoidance of linear patterns
- Construction of one-dimensional subsets of the reals not containing similar copies of given patterns
- Finding Patterns Avoiding Many Monochromatic Constellations
- Large Sets Avoiding Rough Patterns
- Full dimensional sets without given patterns
- Large sets avoiding linear patterns
- Density theorems for anisotropic point configurations
- A framework for constructing sets without configurations
- Small sets containing any pattern
- Sets of full measure avoiding Cantor sets
- Large subsets of Euclidean space avoiding infinite arithmetic progressions
- On some properties of sparse sets: a survey
- scientific article; zbMATH DE number 7731180 (Why is no real title available?)
- Large sets avoiding Infinite arithmetic / geometric progressions
- Simplices in thin subsets of Euclidean spaces
- Large dimensional sets not containing a given angle
- Large sets containing no copies of a given infinite sequence
- Arithmetic progressions and thickness properties in self-similar Cantor sets
- Dimensions of sets avoiding approximate nontrivial zeros of linear patterns
This page was built for publication: Large sets avoiding patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747202)
