Related papers: Local Complexity of Delone Sets and Crystallinity

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…

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…

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…

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…

We complete the proof of the upper bound $\hat\rho_3\leq 10R$ for the regularity radius of Delone sets in three-dimensional Euclidean space. Namely, summing up the results obtained earlier, and adding the missing cases, we show that if all…

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.…

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…

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…

Delone sets are locally finite point sets, such that (a) any two points are separated by a given minimum distance, and (b) there is a given radius so that every ball of that radius contains at least one point. Important examples include the…

A discrete set in the Euclidian space is almost periodic, if the measure with the unite masses at points of the set is almost periodic in the weak sense. We prove the following result: if A is a discrete almost periodic set and the set A-A…

Delone sets of finite local complexity in Euclidean space are investigated. We show that such a set has patch counting and topological entropy 0 if it has uniform cluster frequencies and is pure point diffractive. We also note that the…

In this note we present that the patch counting entropy can be obtained as a limit and investigate which sequences of compact sets are suitable to define this quantity. We furthermore present a geometric definition of patch counting entropy…

We characterize equicontinuous Delone dynamical systems as those coming from Delone sets with strongly almost periodic Dirac combs. Within the class of systems with nite local complexity the only equicontinuous systems are then shown to be…

A region of two-dimensional space has been filled randomly with large number of growing circular discs allowing only a `slight' overlapping among them just before their growth stop. More specifically, each disc grows from a nucleation…

Sunada's work on crystallography emphasizes the role of the "maximal abelian cover" of a graph $X$. This is a covering space of $X$ for which the group of deck transformations is the first homology group $H_1(X,\mathbb{Z})$. An embedding of…

For Euclidean pure point diffractive Delone sets of finite local complexity and with uniform patch frequencies it is well known that the patch counting entropy computed along the closed centred balls is zero. We consider such sets in the…

We study ideals $\mathcal{I}$ on $\mathbb{N}$ satisfying the following Baire-type property: if $X$ is a complete metric space and $\{X_{A} \colon A \in \mathcal{I} \}$ is a family of nowhere dense subsets of $X$ with $X_{A} \subset X_{B}$…

A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges, and the tessellation cover number, denoted by $T(G)$, is the size…

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…

The main purpose of this paper is to explore the structure of local and regular Dirichlet forms associated with symmetric linear diffusions. Let $(\mathcal{E},\mathcal{F})$ be a regular and local Dirichlet form on $L^2(I,m)$, where $I$ is…