相关论文: Cut-and-project quasicrystals, lattices, and dense…

A dense forest is a set $F \subset \mathbb{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$.…

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…

Cut-and-project from a symmetric structure in a higher-dimensional space is a standard method for describing the structure of a large class of quasicrystals. By means of a novel localization procedure, we now show how local physical…

It is well known that a positive proportion of all points in a $d$-dimensional lattice is visible from the origin, and that these visible lattice points have constant density in $\mathbb{R}^d$. In the present paper we prove an analogous…

The density distribution in solids is often represented as a sum of Gaussian peaks (or similar functions) centred on lattice sites or via a Fourier sum. Here, we argue that representing instead the $\mathit{logarithm}$ of the density…

We study points in cut-and-project sets which are visible from the origin, continuing a direction of inquiry initiated in [6,14] where the asymptotic density of visible points was investigated. We establish an error bound for the density of…

Cut-and-project sets $\Sigma\subset\mathbb{R}^n$ represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project…

Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…

Airborne laser scanning (LiDAR) point clouds over large forested areas can be processed to segment individual trees and subsequently extract tree-level information. Existing segmentation procedures typically detect more than 90% of…

Hyperuniform systems, which include crystals, quasicrystals and special disordered systems, have attracted considerable recent attention, but rigorous analyses of the hyperuniformity of quasicrystals have been lacking because the support of…

A set of points with finite density is constructed in $\mathbb{R}^d$, with $d\geq2$, by adding points to a Poisson process such that any line segment of length $O\left(\varepsilon^{-(d-1)}\ln\varepsilon^{-1}\right)$ in $\mathbb{R}^d$ will…

A set $Y\subseteq\mathbb{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…

This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…

We consider temperate distributions on Euclidean spaces with uniformly discrete support and locally finite spectrum. We find conditions on coefficients of distributions under which they are finite sum of derivatives of generalized lattice…

Motivated by the work of Lov\'asz and Szegedy on the convergence and limits of dense graph sequences, we investigate the convergence and limits of finite trees with respect to sampling in normalized distance. Based on separable real trees,…

Model sets (also called cut and project sets) are generalizations of lattices. Here we show how the self-similarities of model sets are a natural replacement for the group of translations of a lattice. This leads us to the concept of…

It is a surprising fact that the proportion of integer lattice points visible from the origin is exactly $\frac{6}{\pi^2}$, or approximately 60 percent. Hence, approximately 40 percent of the integer lattice is hidden from the origin. Since…

A Fermat spiral is a set of points of the form $\sqrt{n}e^{2\pi i\alpha n}$ for $\alpha \in \mathbb{R}$. In this paper we prove that the Chabauty limits of Fermat spirals are always closed subgroups of $\mathbb{R}^2$, and conclude that no…

We prove that supports of a wide class of temperate distributions with uniformly discrete support and spectrum on Euclidean spaces are finite unions of translations of full-rank lattices. This result is a generalization of the corresponding…

A main goal in lattice theory is the construction of dense lattices. Most of the remarkable dense lattices in small dimensions have an additional symmetry, they are modular, i.e. similar to their dual lattice. Extremal lattices are densest…