Dense forests and Danzer sets

MaRDI QIDQ2958449zbMATH OpenFDO

Authors Yaar Solomon, Barak Weiss

Publication date 2 February 2017

Full work available at URL https://arxiv.org/abs/1406.3807, http://smf4.emath.fr/en/Publications/AnnalesENS/4_49/html/ens_ann-sc_49_1053-1074.php

zbMATH Keywords

cut and project setsDanzer problemdiscrete setssubstitution tilings

Mathematics Subject Classification ID

Homogeneous flows (37A17) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Quasicrystals and aperiodic tilings in discrete geometry (52C23) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: A set $Ysubseteqmathbb{R}^d$ that intersects every convex set of volume $1$ is called a Danzer set. It is not known whether there are Danzer sets in $mathbb{R}^d$ with growth rate $O(T^d)$. We prove that natural candidates, such as discrete sets that arise from substitutions and from cut-and-project constructions, are not Danzer sets. For cut and project sets our proof relies on the dynamics of homogeneous flows. We consider a weakening of the Danzer problem, the existence of uniformly discrete dense forests, and we use homogeneous dynamics (in particular Ratner's theorems on unipotent flows) to construct such sets. We also prove an equivalence between the above problem and a well-known combinatorial problem, and deduce the existence of Danzer sets with growth rate $O(T^{d}logT)$, improving the previous bound of $O(T^{d}lo{g}^{d-1}T)$.

Recommendations

• Around the Danzer problem and the construction of dense forests
• Dendroidal sets
• Danzer's problem, effective constructions of dense forests and digital sequences
• Dense Subsets of Products of Finite Trees
• Densing sets
• Dense sets and embedding binary trees into hypercubes
• scientific article; zbMATH DE number 859893
• Dense free sets
• Bounded degree complexes of forests
• scientific article; zbMATH DE number 5279431

Cited in

(11)

• On visibility problems with an infinite discrete set of obstacles
• Around the Danzer problem and the construction of dense forests
• Visibility properties of spiral sets
• A Danzer set for axis parallel boxes
• Uniformly Discrete Forests with Poor Visibility
• On problems of Danzer and Gowers and dynamics on the space of closed subsets of R^d
• Dense forests constructed from grids
• Danzer's problem, effective constructions of dense forests and digital sequences
• Classification and statistics of cut-and-project sets
• On the maximal volume of empty convex bodies amidst multivariate dilates of a lacunary integer sequence
• A new construction of forests with low visibility

This page was built for publication: Dense forests and Danzer sets

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