Classification and statistics of cut and project sets
René Rühr, Yotam Smilansky, Barak Weiss
备注：
75 pages. To appear in the Journal of the European Mathematical Society. Revision taking into account referee comments. All results unchanged but substantial revision in several proofs
We define Ratner-Marklof-Strombergsson measures. These are probability measures supported on cut-and-project sets in R^d (d > 1) which are invariant and ergodic for the action of the groups ASL_d(R) or SL_d(R). We classify the measures that can arise in terms of algebraic groups and homogeneous dynamics. Using the classification, we prove analogues of results of Siegel, Weil and Rogers about a Siegel summation formula and identities and bounds involving higher moments. We deduce results about asymptotics, with error estimates, of point-counting and patch-counting for typical cut-and-project sets.
In the study of aperiodic order via dynamical methods, topological entropy is an important concept. In this paper, parts of the theory, like Bowen's formula for fibre wise entropy or the independence of the definition from the choice of a Van Hove sequence, are extended to actions of several non-discrete groups. To establish these results, we will show that the Ornstein-Weiss lemma is valid for all considered groups which appear in the study of cut and project schemes.
We construct model sets arising from cut and project schemes in Euclidean spaces whose associated Delone dynamical systems have positive toplogical entropy. The construction works both with windows that are proper and with windows that have empty interior. In a probabilistic construction, the entropy almost surely turns out to be proportional to the measure of the boundary of the window.
In this article pattern statistics of typical cubical cut and project sets are studied. We give estimates for the rate of convergence of appearances of patches to their asymptotic frequencies. We also give bounds for repetitivity and repulsivity functions. The proofs use ideas and tools developed in discrepancy theory.
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with cubical windows. We also prove that these are precisely the collection of such sets which satisfy subadditive ergodic theorems. The results are explicit enough to allow us to apply them to known classical models, and to construct linearly repetitive cut and project sets in all pairs of dimensions and codimensions in which they exist.
Cut-and-project sets $Σ\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 sets find application in solid state physics as mathematical models of atomic positions in quasicrystals, the description of their symmetries is therefore of high importance. We focus on the question when a linear map $A$ on $\mathbb{R}^n$ is a self-similarity of a cut-and-project set $Σ$, i.e.\ satisfies $AΣ\subsetΣ$. We characterize such mappings $A$ and provid…
This paper uses a connection between bounded remainder sets in $\mathbb{R}^d$ and cut-and-project sets in $\mathbb{R}$ together with the fact that each one-dimensional Pisot substitution sequence is bounded distance equivalent to some lattice in order to construct several bounded remainder sets with fractal boundary. Moreover it is shown that there are cut-and-project sets being not bounded distance equivalent to each other even if they are locally indistinguishable, more precisely: even if they are contained in the same hull.
This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice projects densely into the internal space and (possibly after translation) hits each supporting hyperplane of the polytopal window. Our main result is that LR is satisfied if and only if the patterns are of low complexity (property C), and the projected lattice satisfies a Diophantine condition (property D). Property C can be checked by computation of the rank…
For any irrational cut-and-project setup, we demonstrate a natural infinite family of windows which gives rise to separated nets that are each bounded distance to a lattice. Our proof provides a new construction, using a sufficient condition of Rauzy, of an infinite family of non-trivial bounded remainder sets for any totally irrational toral rotation in any dimension.
We establish a connection between gaps problems in Diophantine approximation and the frequency spectrum of patches in cut and project sets with special windows. Our theorems provide bounds for the number of distinct frequencies of patches of size r, which depend on the precise cut and project sets being used, and which are almost always less than a power of log r. Furthermore, for a substantial collection of cut and project sets we show that the number of frequencies of patches of size r remains bounded as r tends to infinity. The latter result applies to a collection of cut and project sets o…
We prove that in any totally irrational cut-and-project setup with codimension (internal space dimension) one, it is possible to choose sections (windows) in non-trivial ways so that the resulting sets are bounded displacement to lattices. Our proof demonstrates that for any irrational $α$, regardless of Diophantine type, there is a collection of intervals in $\mathbb{R}/\mathbb{Z}$ which is closed under translation, contains intervals of arbitrarily small length, and along which the discrepancy of the sequence $\{nα\}$ is bounded above uniformly by a constant.
Recent results of several authors have led to constructions of parallelotopes which are bounded remainder sets for totally irrational toral rotations. In this brief note we explain, in retrospect, how some of these results can easily be obtained from a geometric argument which was previously employed by Duneau and Oguey in the study of deformation properties of mathematical models for quasicrystals.
The aim of this paper is to determine the asymptotic growth rate of the complexity function of cut-and-project sets in the non-abelian case. In the case of model sets of polytopal type in homogeneous two-step nilpotent Lie groups we can establish that the complexity function asymptotically behaves like $r^{homdim(G) dim(H)}$. Further we generalize the concept of acceptance domains to locally compact second countable groups.
We present cut and project formalism based on measures and continuous weight functions of sufficiently fast decay. The emerging measures are strongly almost periodic. The corresponding dynamical systems are compact groups and homomorphic images of the underlying torus. In particular, they are strictly ergodic with pure point spectrum and continuous eigenfunctions. Their diffraction can be calculated explicitly. Our results cover and extend corresponding earlier results on dense Dirac combs and continuous weight functions with compact support. They also mark a clear difference in terms of facto…
We study projectional properties of Poisson cut-out sets $E$ in non-Euclidean spaces. In the first Heisenbeg group, endowed with the Korányi metric, we show that the Hausdorff dimension of the vertical projection $π(E)$ (projection along the center of the Heisenberg group) almost surely equals $\min\{2,dim_H(E)\}$ and that $π(E)$ has non-empty interior if $dim_H(E)>2$. As a corollary, this allows us to determine the Hausdorff dimension of $E$ with respect to the Euclidean metric in terms of its Heisenberg Hausdorff dimension $dim_H (E)$. We also study projections in the one-point compactificat…
We consider primitive substitution tilings on R^d whose expansion maps are unimodular. We assume that all the eigenvalues of the expansion maps are algebraic conjugates with the same multiplicity. In this case, we can construct a cut-and-project scheme with a Euclidean internal space. Under some additional condition, we show that if the substitution tiling has pure discrete spectrum, then the corresponding representative point sets are regular model sets in that cut-and-project scheme.
Bounded remainder sets, bounded distance equivalent cut-and-project sets, and equidecomposability
Bar-Ilan University（巴伊兰大学）；Norwegian University of Science and Technology (NTNU)（挪威科技大学）；University of Crete（克里特大学）；Institute of Computer Science, Foundation of Research and Technology Hellas（希腊研究与技术基金会计算机科学研究所）
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 definition of linear repetitivity to try to discover whether or not there is a natural class of cut and project sets which are models for quasicrystals which are better than `perfectly ordered'. In the positive direction, we demonstrate an uncountable collection of such sets (in fact, a collection with large Hausdorff dimension) for every choice of dimension of…
