Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers

From MaRDI portal
Publication:5425751

DOI10.1051/ITA:2007025zbMATH Open1144.11009arXivcs/0608065OpenAlexW1983121560MaRDI QIDQ5425751FDOQ5425751


Authors: Edita Pelantová, Ondřej Turek, L'ubomira Balková Edit this on Wikidata


Publication date: 14 November 2007

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Abstract: We study arithmetical and combinatorial properties of -integers for being the root of the equation x2=mxn,m,ninmathbbN,mgeqn+2geq3. We determine with the accuracy of pm1 the maximal number of -fractional positions, which may arise as a result of addition of two -integers. For the infinite word coding distances between consecutive -integers, we determine precisely also the balance. The word is the fixed point of the morphism AoAm1B and BoAmn1B. In the case n=1 the corresponding infinite word is sturmian and therefore 1-balanced. On the simplest non-sturmian example with ngeq2, we illustrate how closely the balance and arithmetical properties of -integers are related.


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




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers

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