Bounded displacement non-equivalence in substitution tilings
From MaRDI portal
Publication:2005197
DOI10.1016/j.jcta.2020.105326zbMath1448.52017arXiv1907.01597OpenAlexW3081715733MaRDI QIDQ2005197
Yotam Smilansky, Yaar Solomon, Dirk Frettlöh
Publication date: 7 October 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.01597
Related Items (6)
A dichotomy for bounded displacement equivalence of Delone sets ⋮ Statistics and gap distributions in random Kakutani partitions and multiscale substitution tilings ⋮ Divergence of separated nets with respect to displacement equivalence ⋮ Uniform distribution of Kakutani partitions generated by substitution schemes ⋮ Tilings from graph directed iterated function systems ⋮ Number of bounded distance equivalence classes in hulls of repetitive Delone sets
Cites Work
- Unnamed Item
- An uncountable set of tiling spaces with distinct cohomology
- Some examples of repetitive, nonrectifiable Delone sets
- Substitution tilings and separated nets with similarities to the integer lattice
- The family of bi-Lipschitz classes of Delone sets in Euclidean space has the cardinality of the continuum
- Separated nets in Euclidean space and Jacobians of biLipschitz maps
- Lipschitz maps and nets in Euclidean space
- Cohomology of one-dimensional mixed substitution tiling spaces
- Shifts of finite type and random substitutions
- A simple condition for bounded displacement
- Linearly repetitive Delone sets are rectifiable
- Equivalence relations on separated nets arising from linear toral flows
- Bounded interpolations between lattices
- Uniformly Spread Discrete Sets in R d
- Geometric realizations of substitutions
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- Automaticity, goals, and environmental interactions.
- FACTORIZATION OF EVEN GRAPHS
This page was built for publication: Bounded displacement non-equivalence in substitution tilings
