The paper studies conditions on S and abelian complexity of infinite words x that guarantee S(L_x) contains all but finitely many naturals, examining this for specific words with varying abelian complexities.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The abelian complexity of infinite words and the Frobenius problem
The paper studies conditions on S and abelian complexity of infinite words x that guarantee S(L_x) contains all but finitely many naturals, examining this for specific words with varying abelian complexities.