2000 character limit reached
The density of sets containing large similar copies of finite sets (2007.03493v3)
Published 7 Jul 2020 in math.CA
Abstract: We prove that if $E \subseteq \mathbb{R}d$ ($d\geq 2$) is a Lebesgue-measurable set with density larger than $\frac{n-2}{n-1}$, then $E$ contains similar copies of every $n$-point set $P$ at all sufficiently large scales. Moreover, `sufficiently large' can be taken to be uniform over all $P$ with prescribed size, minimum separation and diameter. On the other hand, we construct an example to show that the density required to guarantee all large similar copies of $n$-point sets tends to $1$ at a rate $1- O(n{-1/5}\log n)$.