Related papers: Delone sets generated by square roots
A Delone set in $\mathbb{R}^n$ is a set such that (a) the distance between any two of its points is uniformly bounded below by a strictly positive constant and such that (b) the distance from any point to the remaining points in the set is…
We construct examples of Delone sets of the plane (that is, discrete subsets that are uniformly separated and coarsely dense) that are repetitive (each patch of the set appears in every large-enough ball) though non-rectifiable (i.e. non…
In the paper, we prove that in an arbitrary Delone set $X$ in $3D$ space, the subset $X_6$ of all points from $X$ at which local groups have axes of the order not greater than 6 is also a Delone set. Here, under the local group at point…
Delone sets are discrete point sets $X$ in $\mathbb{R}^d$ characterized by parameters $(r,R)$, where (usually) $2r$ is the smallest inter-point distance of $X$, and $R$ is the radius of a largest ``empty ball" that can be inserted into the…
The local theory for regular and multi-regular systems was developed in the assumption that these systems are Delone sets, or (r;R)-systems. The requirement for a set to be a (r;R)-system particularly implies that any two points in a Delone…
In the paper we present a proof of the local criterion for crystalline structures which generalizes the local criterion for regular systems. A Delone set is called a crystal if it is invariant with respect to a crystallgraphic group.…
With a view to establishing measure theoretic approximation properties of Delone sets, we study a setup which arises naturally in the problem of averaging almost periodic functions along exponential sequences. In this setting, we establish…
This paper deals with certain dynamical systems built from point sets and, more generally, measures on locally compact Abelian groups. These systems arise in the study of quasicrystals and aperiodic order, and important subclasses of them…
A planar point set of $n$ points is called {\em $\gamma$-dense} if the ratio of the largest and smallest distances among the points is at most $\gamma\sqrt{n}$. We construct a dense set of $n$ points in the plane with…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
This paper considers the problem of characterizing the simplest discrete point sets that are aperiodic, using invariants based on topological dynamics. A Delone set whose patch-counting function N(T), for radius T, is finite for all T is…
The Delaunay triangulation (DT) is one of the most common and useful triangulations of point sets $P$ in the plane. DT is not unique when $P$ is degenerate, specifically when it contains quadruples of co-circular points. One way to achieve…
In these expository notes we focus on selected topics around the themes: Delone sets as models for quasicrystals, inflation symmetries and expansion constants, substitution Delone sets and tilings, and associated dynamical systems.
This paper characterizes when a Delone set X is an ideal crystal in terms of restrictions on the number of its local patches of a given size or on the hetereogeneity of their distribution. Let N(T) count the number of…
The paper establishes an equivalence between pure point diffraction and certain types of model sets, called inter model sets, in the context of substitution point sets and substitution tilings. The key ingredients are a new type of…
A general Archimedean spiral lattice is a Delone set in the relative distance if and only if its rotation angle is badly approximable.
The local theory of regular or multi-regular systems aims at finding sufficient local conditions for a Delone set $X$ to be a regular or multi-regular system. One of the main goals is to estimate the regularity radius $\hat{\rho}_d$ for…
We consider the collection of uniformly discrete point sets in Euclidean space equipped with the vague topology. For a point set in this collection, we characterise minimality of an associated dynamical system by almost repetitivity of the…
The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…
This paper addresses the problem of describing aperiodic discrete structures that have a self-similar or self-affine structure. Substitution Delone set families are families of Delone sets (X_1, ..., X_n) in R^d that satisfy an inflation…