Discrepancy and rectifiability of almost linearly repetitive Delone sets
نویسندگان
چکیده
We extend a discrepancy bound of Lagarias and Pleasants for local weight distributions on linearly repetitive Delone sets show that similar holds also the more general case without finite complexity if linear repetitivity is replaced by $\varepsilon$-linear repetitivity. As result we establish are some sufficiently small $\varepsilon$ rectifiable, incommensurable multiscale substitution tilings never almost repetitive.
منابع مشابه
Aperiodic Linearly Repetitive Delone Sets Are Densely Repetitive
We show that aperiodic linearly repetitive Delone sets are densely repetitive. This confirms a conjecture of Lagarias and Pleasants.
متن کاملRepetitive Delone Sets and Quasicrystals
This paper studies the problem of characterizing the simplest aperiodic discrete point sets, using invariants based on topological dynamics. A Delone set of finite type is a Delone set X such that X −X is locally finite. Such sets are characterized by their patch-counting function NX(T ) of radius T being finite for all T . We formulate conjectures relating slow growth of the patch-counting fun...
متن کاملRepetitive Delone Sets and Perfect QuasicrystalsJe
This paper considers the problem of characterizing the simplest discrete point sets that are aperiodic, using invariants based on topological dynamics. A Delone set of nite type is a Delone set X such that X ? X is locally nite. Such sets are characterized by their patch-counting function N X (T) of radius T being nite for all T. A Delone set X of nite type is repetitive if there is a function ...
متن کاملSubstitution Delone Sets
Substitution Delone set families are families of Delone sets X = (X1, . . . ,Xn) which satisfy the inflation functional equation
متن کاملLocal Complexity of Delone Sets and
This paper characterizes when a Delone setX in Rn 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. For a Delone set X, let NX(T ) count the number of translation-inequivalent patches of radius T in X and let MX(T ) be the minimum radius such that every closed ball of radius MX(T ) contains the center ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinearity
سال: 2022
ISSN: ['0951-7715', '1361-6544']
DOI: https://doi.org/10.1088/1361-6544/ac9503