Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers

DOI10.1515/INTEG.2009.025MaRDI QIDQ3182865zbMATH OpenFDO

Authors Karel Klouda, Edita Pelantová

Publication date 16 October 2009

Published in INTEG (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0812.0164, https://eudml.org/doc/117736

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Parry numbersfactor complexity function

Mathematics Subject Classification ID

Combinatorics on words (68R15) PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06)

Abstract: The factor complexity of the infinite word $ubeta$ canonically associated to a non-simple Parry number $$ is studied. Our approach is based on the notion of special factors introduced by Berstel and Cassaigne. At first, we give a handy method for determining infinite left special branches; this method is applicable to a broad class of infinite words which are fixed points of a primitive substitution. In the second part of the article, we focus on infinite words $ubeta$ only. To complete the description of its special factors, we define and study $(a,b)$-maximal left special factors. This enables us to characterize non-simple Parry numbers $$ for which the word $ubeta$ has affine complexity.

Recommendations

• Palindromic complexity of infinite words associated with non-simple Parry numbers
• Infinite special branches in words associated with beta-expansions
• Palindromic complexity of infinite words associated with simple Parry numbers
• Abelian complexity of infinite words associated with quadratic Parry numbers
• Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers

Cited in

(14)

• Complexity of leading digit sequences
• Infinite special branches in words associated with beta-expansions
• Complexity of infinite words associated with beta-expansions
• scientific article; zbMATH DE number 2051159 (Why is no real title available?)
• Complexity for infinite words associated with quadratic non-simple Parry numbers
• Palindromic complexity of infinite words associated with simple Parry numbers
• Palindromic complexity of infinite words associated with non-simple Parry numbers
• Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
• Abelian complexity of infinite words associated with quadratic Parry numbers
• On a class of infinite words with affine factor complexity
• Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers
• Balances and Abelian complexity of a certain class of infinite ternary words
• On the structure of (- )-integers
• On low-complexity bi-infinite words and their factors

This page was built for publication: Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers

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