Inverse problems of symbolic dynamics

From MaRDI portal
Publication:3112331

DOI10.4064/BC94-0-2zbMATH Open1263.37019arXiv1104.5605OpenAlexW3104476033MaRDI QIDQ3112331FDOQ3112331

Ivan Mitrofanov, A. Ya Belov, G. V. Kondakov

Publication date: 13 January 2012

Published in: Banach Center Publications (Search for Journal in Brave)

Abstract: This paper reviews some results regarding symbolic dynamics, correspondence between languages of dynamical systems and combinatorics. Sturmian sequences provide a pattern for investigation of one-dimensional systems, in particular interval exchange transformation. Rauzy graphs language can express many important combinatorial and some dynamical properties. In this case combinatorial properties are considered as being generated by substitutional system, and dynamical properties are considered as criteria of superword being generated by interval exchange transformation. As a consequence, one can get a morphic word appearing in interval exchange transformation such that frequencies of letters are algebraic numbers of an arbitrary degree. Concerning multydimensional systems, our main result is the following. Let P(n) be a polynomial, having an irrational coefficient of the highest degree. A word w (w=(wn),ninit) consists of a sequence of first binary numbers of P(n) i.e. wn=[2P(n)]. Denote the number of different subwords of w of length k by T(k) . medskip {οΏ½f Theorem.} {it There exists a polynomial Q(k), depending only on the power of the polynomial P, such that T(k)=Q(k) for sufficiently great k.}


Full work available at URL: https://arxiv.org/abs/1104.5605






Cited In (5)


   Recommendations





This page was built for publication: Inverse problems of symbolic dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3112331)