Dense forests constructed from grids

DOI10.1007/S00209-023-03331-5MaRDI QIDQ6063913zbMATH OpenOpenAlexFDO

Authors Victor Shirandami

Publication date 8 November 2023

Published in Mathematische Zeitschrift (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Diophantine approximationlatticesmetric number theory

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Approximation by numbers from a fixed field (11J17) Diophantine inequalities (11J25) Diophantine approximation in probabilistic number theory (11K60) Miscellaneous applications of number theory (11Z05) Geometric constructions in real or complex geometry (51M15)

Abstract: A dense forest is a set $Fsubsetmathbb{R}^n$ with the property that for all $varepsilon>0$ there exists a number $V(varepsilon)>0$ such that all line segments of length $V(varepsilon)$ are $varepsilon$-close to a point in $F$. The function $V$ is called a visibility function of $F$. In this paper we study dense forests constructed from finite unions of translated lattices (grids). First, we provide a necessary and sufficient condition for a finite union of grids to be a dense forest in terms of the irrationality properties of the matrices defining them. This answers a question raised by Adiceam, Solomon, and Weiss (2022). To complement this, we further show that such sets generically admit effective visibility bounds in the following sense: for all $eta>0$, there exists a $kinmathbbN$ such that almost all unions of $k$ grids are dense forests admitting a visibility function $V(varepsilon)llvarepsilo{n}^{-(n-1)-eta}$. This is arbitrarily close to optimal in the sense that if a finite union of grids admits a visibility function $V$, then this function necessarily satisfies $V(varepsilon)ggvarepsilo{n}^{-(n-1)}$. One of the main novelties of this work is that the notion of `almost all' is considered with respect to several underlying measures, which are defined according to the Iwasawa decomposition of the matrices used to define the grids. In this respect, the results obtained here vastly extend those of Adiceam, Solomon, and Weiss (2022) who provided similar effective visibility bounds for a particular family of generic unimodular lattices.

Recommendations

• Danzer's problem, effective constructions of dense forests and digital sequences
• Around the Danzer problem and the construction of dense forests
• Uniformly Discrete Forests with Poor Visibility
• Dense forests and Danzer sets
• Cut‐and‐project quasicrystals, lattices and dense forests

Cites work

• A set containing rectifiable arcs QC-locally but not QC-globally
• Cut‐and‐project quasicrystals, lattices and dense forests
• Danzer's problem, effective constructions of dense forests and digital sequences
• Dense forests and Danzer sets
• Ergodization time for linear flows on tori via geometry of numbers
• Filling times for linear flow on the torus with truncated Diophantine conditions: a brief review and new proof
• scientific article; zbMATH DE number 3125787 (Why is no real title available?)
• scientific article; zbMATH DE number 3440485 (Why is no real title available?)
• scientific article; zbMATH DE number 2117213 (Why is no real title available?)
• On a problem of Danzer
• On Some Measures Analogous to Haar Measure.
• On transfer inequalities in Diophantine approximation. II
• Uniformly Discrete Forests with Poor Visibility

Cited in

(4)

• Around the Danzer problem and the construction of dense forests
• Forest-based networks
• Coherent forests
• Short Tours through Large Linear Forests

This page was built for publication: Dense forests constructed from grids

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