Danzer's problem, effective constructions of dense forests and digital sequences

DOI10.1112/MTK.12153zbMATH Open1522.52008arXiv2111.02773OpenAlexW3209553585MaRDI QIDQ6074969FDOQ6074969

Authors: Ioannis Tsokanos 

Publication date: 20 September 2023

Published in: Mathematika (Search for Journal in Brave)

Abstract: A 1965 problem due to Danzer asks whether there exists a set in Euclidean space with finite density intersecting any convex body of volume one. A recent approach to this problem is concerned with the construction of dense forests and is obtained by a suitable weakening of the volume constraint. A dense forest is a discrete point set of finite density getting uniformly close to long enough line segments. The distribution of points in a dense forest is then quantified in terms of a visibility function. Another way to weaken the assumptions in Danzer's problem is by relaxing the density constraint. In this respect, a new concept is introduced in this paper, namely that of an optical forest. An optical forest in $mathbb{R}^d$ is a point set with optimal visibility but not necessarily with finite density. In the literature, the best constructions of Danzer sets and dense forests lack effectivity. The goal of this paper is to provide constructions of dense and optical forests which yield the best known results in any dimension $dge2$ both in terms of visibility and density bounds and effectiveness. Namely, there are three main results in this work: (1) the construction of a dense forest with the best known visibility bound which, furthermore, enjoys the property of being deterministic; (2) the deterministic construction of an optical forest with a density failing to be finite only up to a logarithm and (3) the construction of a planar Peres-type forest (that is, a dense forest obtained from a construction due to Peres) with the best known visibility bound. This is achieved by constructing a deterministic digital sequence satisfying strong dispersion properties.

Full work available at URL: https://arxiv.org/abs/2111.02773

Recommendations

• Around the Danzer problem and the construction of dense forests
• Dense forests and Danzer sets
• Uniformly Discrete Forests with Poor Visibility
• A Danzer set for axis parallel boxes
• How far can you see in a forest?

zbMATH Keywords

dense forestDanzer's problemoptical forest

Mathematics Subject Classification ID

Diophantine approximation in probabilistic number theory (11K60) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Density, gaps, topology (11B05)

Cites Work

• Sequences, discrepancies and applications
• \(\epsilon\)-nets and simplex range queries
• On problems of Danzer and Gowers and dynamics on the space of closed subsets of \(\mathbb R^d\)
• A set containing rectifiable arcs QC-locally but not QC-globally
• Well dispersed sequences in \([0,1]^{d}\)
• A Sequence Well Dispersed in the Unit Square
• On a method of constructing well-dispersed sequences
• Dense forests and Danzer sets
• Uniformly Discrete Forests with Poor Visibility
• How far can you see in a forest?
• Around the Danzer problem and the construction of dense forests
• On a problem of Danzer
• Cut‐and‐project quasicrystals, lattices and dense forests

Cited In (5)

• Dense forests constructed from grids
• Around the Danzer problem and the construction of dense forests
• How far can you see in a forest?
• A Danzer set for axis parallel boxes
• Dense forests and Danzer sets

This page was built for publication: Danzer's problem, effective constructions of dense forests and digital sequences

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