The density of sets containing large similar copies of finite sets

Kenneth Falconer, Vjekoslav Kovač, Alexia Yavicoli*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Downloads (Pure)

Abstract

We prove that if E⊆Rd (d≥2) is a Lebesgue-measurable set with density larger than (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/5log n).
Original languageEnglish
Pages (from-to)339-359
Number of pages21
JournalJournal d'Analyse Mathématique
Volume148
Issue number1
Early online date17 Nov 2022
DOIs
Publication statusPublished - 17 Nov 2022

Keywords

  • Pattern
  • Density
  • Similarity
  • Arithmetic progression
  • Discrepancy

Fingerprint

Dive into the research topics of 'The density of sets containing large similar copies of finite sets'. Together they form a unique fingerprint.

Cite this