Bratteli diagrams where random orders are imperfect

For the simple Bratteli diagrams B where there is a single edge connecting any two vertices in consecutive levels, we show that a random order has uncountably many infinite paths if and only if the growth rate of the level-n vertex sets is super-linear. This gives us the dichotomy: a random order on a slowly growing Bratteli diagram admits a homeomorphism, while a random order on a quickly growing Bratteli diagram does not. We also show that for a large family of infinite rank Bratteli diagrams B, a random order on B does not admit a continuous Vershik map

Perfect orderings on finite rank Bratteli diagrams

Given a Bratteli diagram B, we study the set OB of all possible orderings on B and its subset PB consisting of perfect orderings that produce Bratteli–Vershik topological dynamical systems (Vershik maps). We give necessary and sufficient conditions for the ordering ω to be perfect. On the other hand, a wide class of non-simple Bratteli diagrams that do not admit Vershik maps is explicitly described. In the case of finite rank Bratteli diagrams, we show that the existence of perfect orderings with a prescribed number of extreme paths constrains significantly the values of the entries of the incidence matrices and the structure of the diagram B. Our proofs are based on the new notions of skeletons and associated graphs, defined and studied in the paper. For a Bratteli diagram B of rank k, we endow the set OB with product measure µ and prove that there is some 1 ≤ j ≤ k such that µalmost all orderings on B have j maximal and j minimal paths. If j is strictly greater than the number of minimal components that B has, then µ-almost all orderings are imperfect

Torsion-free S-adic shifts and their spectrum

In this work we study S-adic shifts generated by sequences of morphisms that are constant-length. We call a sequence of constant- length morphisms torsion-free if any prime divisor of one of the lengths is a divisor of infinitely many of the lengths. We show that torsion- free directive sequences generate shifts that enjoy the property of quasi-recognizability which can be used as a substitute for recognizability. Indeed quasi-recognizable directive sequences can be replaced by a recognizable directive sequence. With this, we give a finer description of the spectrum of shifts generated by torsion-free sequences defined on a sequence of alphabets of bounded size, in terms of extensions of the notions of height and column number. We illustrate our results throughout with examples that explain the subtleties that can arise

Meyer sets, pisot numbers, and self-similarity in symbolic dynamical systems

Aperiodic order refers to the mathematical formalisation of quasicrystals. Substitutions and cut and project sets are among their main actors; they also play a key role in the study of dynamical systems, whether they are symbolic, generated by tilings, or point sets. We focus here on the relations between quasicrystals and self-similarity from an arithmetical and dynamical viewpoint, illustrating how efficiently aperiodic order irrigates various domains of mathematics and theoretical computer science, on a journey from Diophantine approximation to computability theory. In particular, we see how Pisot numbers allow the definition of simple model sets, and how they also intervene for scaling factors for invariance by multiplication of Meyer sets. We focus in particular on the characterisation due to Yves Meyer: any Pisot or Salem number is a parameter of dilation that preserves some Meyer set

How to prove that a sequence is not automatic

Automatic sequences have many properties that other sequences (in particular, non-uniformly morphic sequences) do not necessarily share. In this paper we survey a number of different methods that can be used to prove that a given sequence is not automatic. When the sequences take their values in a finite field F$\textit{q}$, this also permits proving that the associated formal power series are transcendental over F$\textit{q}$($\textit{X}$)

Tame or wild Toeplitz shifts

We investigate tameness of Toeplitz shifts. By introducing the notion of extended Bratteli–Vershik diagrams, we show that such shifts with finite Toeplitz rank are tame if and only if there are at most countably many orbits of singular fibres over the maximal equicontinuous factor. The ideas are illustrated using the class of substitution shifts. A body of elaborate examples shows that the assumptions of our results cannot be relaxed