Cut-and-project quasicrystals, lattices, and dense forests

Faustin Adiceam, Barak Weiss, Yaar Solomon

Research output: Contribution to journalArticlepeer-review


Dense forests are discrete subsets of Euclidean space which are uniformly close to all sufficiently long line segments. The degree of density of a dense forest is measured by its visibility function. We show that cut-and-project quasicrystals are never dense forests, but their finite unions could be uniformly discrete dense forests. On the other hand, we show that finite unions of lattices typically are dense forests, and give a bound on their visibility function, which is close to optimal. We also construct an explicit finite union of lattices which is a uniformly discrete dense forest with an explicit bound on its visibility.
Original languageEnglish
Pages (from-to)1-35
Number of pages35
JournalJournal of the London Mathematical Society
Publication statusAccepted/In press - 1 Feb 2021


Dive into the research topics of 'Cut-and-project quasicrystals, lattices, and dense forests'. Together they form a unique fingerprint.

Cite this