Skip to Main content Skip to Navigation
Conference papers

Allowed patterns of β -shifts

Abstract : For a real number $β >1$, we say that a permutation $π$ of length $n$ is allowed (or realized) by the $β$-shift if there is some $x∈[0,1]$ such that the relative order of the sequence $x,f(x),\ldots,f^n-1(x)$, where $f(x)$ is the fractional part of $βx$, is the same as that of the entries of $π$ . Widely studied from such diverse fields as number theory and automata theory, $β$-shifts are prototypical examples of one-dimensional chaotic dynamical systems. When $β$ is an integer, permutations realized by shifts have been recently characterized. In this paper we generalize some of the results to arbitrary $β$-shifts. We describe a method to compute, for any given permutation $π$ , the smallest $β$ such that $π$ is realized by the $β$-shift.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Tuesday, October 13, 2015 - 3:07:04 PM
Last modification on : Wednesday, June 26, 2019 - 4:36:03 PM
Long-term archiving on: : Thursday, April 27, 2017 - 12:20:20 AM


Publisher files allowed on an open archive




Sergi Elizalde. Allowed patterns of β -shifts. 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.293-304, ⟨10.46298/dmtcs.2911⟩. ⟨hal-01215112⟩



Record views


Files downloads