Small sets containing any pattern

DOI10.1017/S0305004118000567zbMATH Open1429.28008OpenAlexW3099732631WikidataQ129440545 ScholiaQ129440545MaRDI QIDQ5207972FDOQ5207972

Authors Alexia Yavicoli, Ursula Molter

Publication date 14 January 2020

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.03804

Mathematics Subject Classification ID

Length, area, volume, other geometric measure theory (28A75) Hausdorff and packing measures (28A78) Arithmetic progressions (11B25)

Abstract: Given any dimension function $h$, we construct a perfect set $EsubseteqmathbbR$ of zero $h$-Hausdorff measure, that contains any finite polynomial pattern. This is achieved as a special case of a more general construction in which we have a family of functions $mathcalF$ that satisfy certain conditions and we construct a perfect set $E$ in $mathbb{R}^N$, of $h$-Hausdorff measure zero, such that for any finite set $f_1,ldots,f_{n}subseteqmathcalF$, $E$ satisfies that $$. We also obtain an analogous result for the images of functions. Additionally we prove some related results for countable (not necessarily finite) intersections, obtaining, instead of a perfect set, an $mathcal{F}_{sigma}$ set without isolated points.

Recommendations

• Large sets avoiding patterns
• On polynomial configurations in fractal sets
• Large sets avoiding linear patterns
• Sets of large dimension not containing polynomial configurations
• Full dimensional sets without given patterns

Cites work

• scientific article; zbMATH DE number 3719449 (Why is no real title available?)
• scientific article; zbMATH DE number 3489232 (Why is no real title available?)
• Arithmetic progressions in sets of fractional dimension
• Construction of one-dimensional subsets of the reals not containing similar copies of given patterns
• Covering $\mathbb R$ with translates of a compact set
• Dichotomy for arithmetic progressions in subsets of reals
• Equilateral triangles in subsets of \(\mathbb{R}^d\) of large Hausdorff dimension
• Finite configurations in sparse sets
• Full dimensional sets without given patterns
• Large sets avoiding linear patterns
• Large sets avoiding patterns
• On a Problem of Erdos on Sequences and Measurable Sets
• On a problem of Erdős on fractal combinatorial geometry
• On polynomial configurations in fractal sets
• On sets of integers containing k elements in arithmetic progression
• On the intersections of transforms of linear sets
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• Polynomial patterns in the primes
• Sets of large dimension not containing polynomial configurations
• Squares and their centers
• The primes contain arbitrarily long polynomial progressions

Cited in

(7)

• Very small sets
• Large sets avoiding linear patterns
• Patterns in thick compact sets
• Intersections of thick compact sets in \(\mathbb{R}^d\)
• On polynomial configurations in fractal sets
• On sets containing an affine copy of bounded decreasing sequences
• scientific article; zbMATH DE number 3972864 (Why is no real title available?)

This page was built for publication: Small sets containing any pattern

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207972)