Maria Isabel Cortez, Fabien Durand, Samuel Petite
We prove linearly repetitive Delone systems have finitely many Delone system factors up to conjugacy. This result is also applicable to linearly repetitive tiling systems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We show that aperiodic linearly repetitive Delone sets are densely repetitive. This confirms a conjecture of Lagarias and Pleasants.
We extend a discrepancy bound of Lagarias and Pleasants for local weight distributions on linearly repetitive Delone sets and show that a similar bound holds also for the more general case of Delone sets without finite local complexity if linear repetitivity is replaced by $\varepsilon$-linear repetitivity. As a result we establish that Delone sets that are $\varepsilon$-linear repetitive for some sufficiently small $\varepsilon$ are rectifiable, and that incommensurable multiscale substitution tilings are never almost linearly repetitive.
Two Delone sets are bounded distance equivalent to each other if there is a bijection between them such that the distance of corresponding points is uniformly bounded. Bounded distance equivalence is an equivalence relation. We show that the hull of a repetitive Delone set with finite local complexity has either one equivalence class or uncountably many. A very similar result is proven in arXiv:2011.00106 [math.MG].
In this paper we study linearly repetitive Delone sets and prove, following the work of Bellissard, Benedetti and Gambaudo, that the hull of a linearly repetitive Delone set admits a properly nested sequence of box decompositions (tower system) with strictly positive and uniformly bounded (in size and norm) transition matrices. This generalizes a result of Durand for linearly recurrent symbolic systems. Furthermore, we apply this result to give a new proof of a classic estimation of Lagarias and Pleasants on the rate of convergence of patch-frequencies.
In this paper we prove that, for any integer $d>0$, every linearly repetitive Delone set in the Euclidean $d$-space $\RR^d$ is equivalent, up to a bi-Lipschitz homeomorphism, to the integer lattice $\ZZ^d$. In the particular case when the Delone set $X$ in $\RR^d$ comes from a primitive substitution tiling of $\RR^d$, we give a condition on the eigenvalues of the substitution matrix which implies the existence of a homeomorphism with bounded displacement from $X$ to the lattice lattice $λ\ZZ^d$ for some positive $λ$. This condition includes primitive Pisot substitution tilings but also concern…
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 bi-Lipschitz equivalent to the standard lattice). More generally, we construct such a set so that the translation action on the closure of its orbit has any prescribed Choquet simplex as its set of invariant probability measures (in particular, we provide uniquely ergodic examples). The construction relies on classical examples of Burago-Kleiner and McMullen, …
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 point set. We also provide linear versions of almost repetitivity which lead to uniquely ergodic systems. Apart from linearly repetitive point sets, examples are given by periodic point sets with almost periodic modulations, and by point sets derived from primitive substitution tilings of finite local complexity with respect to the Euclidean group with dense…
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 called repetitive if there is a function M(T) such that every ball of radius M(T)+T contains a copy of each kind of patch of radius T that occurs in the set. This is equivalent to the minimality of an associated topological dynamical system with R^n-action. There is a lower bound for M(T) in terms of N(T), namely N(T) = O(M(T)^n), but no general upper bound. T…
Linear repetitivity beyond abelian groups
本文将线性重复 Delone 集包络的唯一遍历性推广到阿贝尔群之外，并借助 Ornstein–Weiss 拟铺砌与次可加收敛定理，在可和幺模 lcsc 群中建立缓增重复条件下的相应结论。
We consider pattern spaces of aperiodic and repetitive Delone sets of finite local complexity. These spaces are compact metric spaces and constitute a special class of foliated spaces. We define new Sobolev spaces with respect to the unique invariant measure and prove the existence of the unitary Schrödinger semigroup, which in physics terms describe the evolution of phasons. We define and study natural leafwise diffusion processes on these pattern spaces. These processes have Feller, but lack strong Feller and hypercontractivity properties, and heat kernels do not exist. The associated Dirich…
Aperiodic and linearly repetitive Lorentz gases of finite horizon are not exponentially mixing
该研究证明有限视界的非周期线性重复 Lorentz 气体对任意 Hölder 可观测量均无指数或拉伸指数混合，并给出依赖 α 的多项式混合速度界。
Symbolic substitution systems beyond abelian groups
本文通过符号替换方法，在非交换李群中构造了首个强非周期性线性重复Delone集，展示了其极小性、唯一测度性和弱非周期性特性。
Classification of discrete weak KAM solutions on linearly repetitive quasi-periodic sets
本文证明非退化弱扭转相互作用下离散弱KAM解存在，并在线性重复准周期集等变条件下完成其全部分类。
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.
At the turn of this century Durand, and Lagarias and Pleasants established that key features of minimal subshifts (and their higher-dimensional analogues) to be studied are linearly repetitive, repulsive and power free. Since then, generalisations and extensions of these features, namely $α$-repetitive, $α$-repulsive and $α$-finite ($α\geq 1$), have been introduced and studied. We establish the equivalence of $α$-repulsive and $α$-finite for general subshifts over finite alphabets. Further, we studied a family of aperiodic minimal subshifts stemming from Grigorchuk's infinite $2$-group $G$. In…
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…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。