Show simple item record

Files in this item

Thumbnail
Thumbnail

Item metadata

dc.contributor.authorFalconer, Kenneth
dc.contributor.authorKovač, Vjekoslav
dc.contributor.authorYavicoli, Alexia
dc.date.accessioned2021-10-19T14:30:01Z
dc.date.available2021-10-19T14:30:01Z
dc.date.issued2022-11-17
dc.identifier.citationFalconer , K , Kovač , V & Yavicoli , A 2022 , ' The density of sets containing large similar copies of finite sets ' , Journal d'Analyse Mathématique , vol. 148 , no. 1 , pp. 339-359 . https://doi.org/10.1007/s11854-022-0231-6en
dc.identifier.issn0021-7670
dc.identifier.otherPURE: 269135153
dc.identifier.otherPURE UUID: cb498bc5-7ca8-42c1-84c0-db7499aedc15
dc.identifier.otherArXiv: http://arxiv.org/abs/2007.03493v1
dc.identifier.otherORCID: /0000-0001-8823-0406/work/123196745
dc.identifier.otherScopus: 85142193997
dc.identifier.otherWOS: 000884960700003
dc.identifier.urihttps://hdl.handle.net/10023/24167
dc.descriptionFunding: VK is supported by the Croatian Science Foundation, project n◦ UIP-2017-05-4129 (MUNHANAP). AY is supported by the Swiss National Science Foundation, grant n◦ P2SKP2 184047.en
dc.description.abstractWe 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).
dc.format.extent21
dc.language.isoeng
dc.relation.ispartofJournal d'Analyse Mathématiqueen
dc.rightsCopyright © 2022, The Hebrew University of Jerusalem. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the author created accepted manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1007/s11854-022-0231-6.en
dc.subjectPatternen
dc.subjectDensityen
dc.subjectSimilarityen
dc.subjectArithmetic progressionen
dc.subjectDiscrepancyen
dc.subjectQA Mathematicsen
dc.subjectT-NDASen
dc.subjectMCCen
dc.subject.lccQAen
dc.titleThe density of sets containing large similar copies of finite setsen
dc.typeJournal articleen
dc.description.versionPreprinten
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.identifier.doihttps://doi.org/10.1007/s11854-022-0231-6
dc.description.statusPeer revieweden
dc.date.embargoedUntil2023-11-17
dc.identifier.urlhttps://arxiv.org/abs/2007.03493en


This item appears in the following Collection(s)

Show simple item record