scholarly journals The number of ergodic measures for transitive subshifts under the regular bispecial condition

2020 ◽  
pp. 1-55
Author(s):  
MICHAEL DAMRON ◽  
JON FICKENSCHER

Abstract If $\mathcal {A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal {A}^{\mathbb {N}}$ of sequences with entries in $\mathcal {A}$ , along with the left shift operator S. Closed S-invariant subsets are called subshifts and arise naturally as encodings of other systems. In this paper, we study the number of ergodic measures for transitive subshifts under a condition (‘regular bispecial condition’) on the possible extensions of words in the associated language. Our main result shows that under this condition, the subshift can support at most $({K+1})/{2}$ ergodic measures, where K is the limiting value of $p(n+1)-p(n)$ , and p is the complexity function of the language. As a consequence, we answer a question of Boshernitzan from 1984, providing a combinatorial proof for the bound on the number of ergodic measures for interval exchange transformations.

2003 ◽  
Vol 13 (07) ◽  
pp. 1937-1948 ◽  
Author(s):  
J. M. Amigó ◽  
J. Szczepański

During the last years a new approach to construct safe block and stream ciphers has been developed using the theory of dynamical systems. Since a block cryptosystem is generally, from the mathematical point of view, a family (parametrized by the keys) of permutations of n-bit numbers, one of the main problems of this approach is to adapt the dynamics defined by a map f to the block structure of the cryptosystem. In this paper we propose a method based on the approximation of f by periodic maps Tn (v.g. some interval exchange transformations). The approximation of automorphisms of measure spaces by periodic automorphisms was introduced by Halmos and Rohlin. One important aspect studied in our paper is the relation between the dynamical properties of the map f (say, ergodicity or mixing) and the immunity of the resulting cipher to cryptolinear attacks, which is currently one of the standard benchmarks for cryptosystems to be considered secure. Linear cryptanalysis, first proposed by M. Matsui, exploits some statistical inhomogeneities of expressions called linear approximations for a given cipher. Our paper quantifies immunity to cryptolinear attacks in terms of the approximation speed of the map f by the periodic Tn. We show that the most resistant block ciphers are expected when the approximated dynamical system is mixing.


2014 ◽  
Vol 16 (01) ◽  
pp. 1350019 ◽  
Author(s):  
JONATHAN FICKENSCHER

Thanks to works by Kontsevich and Zorich followed by Boissy, we have a classification of all Rauzy Classes of any given genus. It follows from these works that Rauzy Classes are closed under the operation of inverting the permutation. In this paper, we shall prove the existence of self-inverse permutations in every Rauzy Class by giving an explicit construction of such an element satisfying the sufficient conditions. We will also show that self-inverse permutations are Lagrangian, meaning any suspension has its vertical cycles span a Lagrangian subspace in homology. This will simplify the proof of a lemma in a work by Forni. Veech proved a bound on the number of distinct ergodic probability measures for a given minimal interval exchange transformation. We verify that this bound is sharp by constructing examples in each Rauzy Class.


2021 ◽  
Vol 17 (0) ◽  
pp. 481
Author(s):  
Sébastien Labbé

<p style='text-indent:20px;'>We extend the notion of Rauzy induction of interval exchange transformations to the case of toral <inline-formula><tex-math id="M1">\begin{document}$ \mathbb{Z}^2 $\end{document}</tex-math></inline-formula>-rotation, i.e., <inline-formula><tex-math id="M2">\begin{document}$ \mathbb{Z}^2 $\end{document}</tex-math></inline-formula>-action defined by rotations on a 2-torus. If <inline-formula><tex-math id="M3">\begin{document}$ \mathscr{X}_{\mathscr{P}, R} $\end{document}</tex-math></inline-formula> denotes the symbolic dynamical system corresponding to a partition <inline-formula><tex-math id="M4">\begin{document}$ \mathscr{P} $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M5">\begin{document}$ \mathbb{Z}^2 $\end{document}</tex-math></inline-formula>-action <inline-formula><tex-math id="M6">\begin{document}$ R $\end{document}</tex-math></inline-formula> such that <inline-formula><tex-math id="M7">\begin{document}$ R $\end{document}</tex-math></inline-formula> is Cartesian on a sub-domain <inline-formula><tex-math id="M8">\begin{document}$ W $\end{document}</tex-math></inline-formula>, we express the 2-dimensional configurations in <inline-formula><tex-math id="M9">\begin{document}$ \mathscr{X}_{\mathscr{P}, R} $\end{document}</tex-math></inline-formula> as the image under a <inline-formula><tex-math id="M10">\begin{document}$ 2 $\end{document}</tex-math></inline-formula>-dimensional morphism (up to a shift) of a configuration in <inline-formula><tex-math id="M11">\begin{document}$ \mathscr{X}_{\widehat{\mathscr{P}}|_W, \widehat{R}|_W} $\end{document}</tex-math></inline-formula> where <inline-formula><tex-math id="M12">\begin{document}$ \widehat{\mathscr{P}}|_W $\end{document}</tex-math></inline-formula> is the induced partition and <inline-formula><tex-math id="M13">\begin{document}$ \widehat{R}|_W $\end{document}</tex-math></inline-formula> is the induced <inline-formula><tex-math id="M14">\begin{document}$ \mathbb{Z}^2 $\end{document}</tex-math></inline-formula>-action on <inline-formula><tex-math id="M15">\begin{document}$ W $\end{document}</tex-math></inline-formula>.</p><p style='text-indent:20px;'>We focus on one example, <inline-formula><tex-math id="M16">\begin{document}$ \mathscr{X}_{\mathscr{P}_0, R_0} $\end{document}</tex-math></inline-formula>, for which we obtain an eventually periodic sequence of 2-dimensional morphisms. We prove that it is the same as the substitutive structure of the minimal subshift <inline-formula><tex-math id="M17">\begin{document}$ X_0 $\end{document}</tex-math></inline-formula> of the Jeandel–Rao Wang shift computed in an earlier work by the author. As a consequence, <inline-formula><tex-math id="M18">\begin{document}$ {\mathscr{P}}_0 $\end{document}</tex-math></inline-formula> is a Markov partition for the associated toral <inline-formula><tex-math id="M19">\begin{document}$ \mathbb{Z}^2 $\end{document}</tex-math></inline-formula>-rotation <inline-formula><tex-math id="M20">\begin{document}$ R_0 $\end{document}</tex-math></inline-formula>. It also implies that the subshift <inline-formula><tex-math id="M21">\begin{document}$ X_0 $\end{document}</tex-math></inline-formula> is uniquely ergodic and is isomorphic to the toral <inline-formula><tex-math id="M22">\begin{document}$ \mathbb{Z}^2 $\end{document}</tex-math></inline-formula>-rotation <inline-formula><tex-math id="M23">\begin{document}$ R_0 $\end{document}</tex-math></inline-formula> which can be seen as a generalization for 2-dimensional subshifts of the relation between Sturmian sequences and irrational rotations on a circle. Batteries included: the algorithms and code to reproduce the proofs are provided.</p>


Axioms ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 80
Author(s):  
Sergey Kryzhevich ◽  
Viktor Avrutin ◽  
Nikita Begun ◽  
Dmitrii Rachinskii ◽  
Khosro Tajbakhsh

We studied topological and metric properties of the so-called interval translation maps (ITMs). For these maps, we introduced the maximal invariant measure and demonstrated that an ITM, endowed with such a measure, is metrically conjugated to an interval exchange map (IEM). This allowed us to extend some properties of IEMs (e.g., an estimate of the number of ergodic measures and the minimality of the symbolic model) to ITMs. Further, we proved a version of the closing lemma and studied how the invariant measures depend on the parameters of the system. These results were illustrated by a simple example or a risk management model where interval translation maps appear naturally.


Sign in / Sign up

Export Citation Format

Share Document