Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sturmian numeration systems and decompositions to palindromes

Published 31 Oct 2017 in cs.FL | (1710.11553v2)

Abstract: We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number $n$ better reflect the structure of the associated Sturmian word. In particular, this extended numeration system helps to catch occurrences of palindromes in a characteristic Sturmian word and thus to prove for Sturmian words the following conjecture stated in 2013 by Puzynina, Zamboni and the author: If a word is not periodic, then for every $Q>0$ it has a prefix which cannot be decomposed to a concatenation of at most $Q$ palindromes.

Citations (25)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.