Related papers: Central sets and substitutive dynamical systems
Using the methods of topological dynamics, H. Furstenberg introduced the notion of a central set and proved the famous Central Sets Theorem. D. De, N. Hindman, and D. Strauss introduced $C$-set, satisfying the strong central set theorem.…
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…
The paper establishes an equivalence between pure point diffraction and certain types of model sets, called inter model sets, in the context of substitution point sets and substitution tilings. The key ingredients are a new type of…
We prove the Pisot Conjecture for beta-substitutions: If beta is a Pisot number, the tiling dynamical system associated with the beta-substitution has pure discrete spectrum. As corollaries: (1) arithmetical coding of the hyperbolic…
Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…
In the theory of zero-dimensional systems and their relation to $C^*$-algebras, Poon (1990) introduced a class of closed sets. We call the closed sets quasi-sections. Medynets (2006) introduced basic sets that are part of quasi-sections in…
There is a growing body of results in the theory of discrete point sets and tiling systems giving conditions under which such systems are pure point diffractive. Here we look at the opposite direction: what can we infer about a discrete…
We give a sufficient geometric condition for a subshift to be measurably isomorphic to a domain exchange and to a translation on a torus. And for an irreducible unit Pisot substitution, we introduce a new topology on the discrete line and…
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…
In [F81] Furstenberg introduced the notion of central set and established his famous Central Sets Theorem. Since then, several improved versions of Furstenberg's result have been found. The strongest generalization has been published by De,…
Overlap coincidence is an equivalent criterion to pure discrete spectrum of the dynamics of self affine tilings. In the case of one dimension, strong coincidence on m letter irreducible substitution has been introduced in Dekking (1978) and…
Hindman and Leader first introduced the notion of semigroup of ultrafilters converging to zero for a dense subsemigroups of $((0,\infty),+)$. Using the algebraic structure of the Stone-$\breve{C}$ech compactification, Tootkabani and Vahed…
We consider substitution tilings and Delone sets without the assumption of finite local complexity (FLC). We first give a sufficient condition for tiling dynamical systems to be uniquely ergodic and a formula for the measure of cylinder…
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics…
We provide a proof for one version of Pisot conjecture. We make use of the weak mixing property of the subshift of finite type derived from the prefix-suffix automaton to conclude that the substitution dynamical system has pure discrete…
We introduce a method for constructing collections of subsets of $\mathbb{R}^{n}$, using an iterated function system, a set $T,$ and a cost function. We refer to these collections as tilings. The special case where $T$ is the central open…
Originating in harmonic analysis, interpolation sets were first studied in dynamics by Glasner and Weiss in the 1980s. A set $S \subset \mathbb{N}$ is an interpolation set for a class of topological dynamical systems $\mathcal{C}$ if any…
We investigate topological mixing of compatible random substitutions. For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent…
Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k length arithmetic progression and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result…
We consider the structure of Pisot substitution tiling spaces, in particular, the structure of those spaces for which the translation action does not have pure discrete spectrum. Such a space is always a measurable m-to-one cover of an…