arXiv:1101.1490 Abstract | arXiv Analytics

Published 2011-01-07Version 1

We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.

Comments: 12 pages

Journal: Theor. Comput. Sci. 412 (2011), 6252-6260

DOI: 10.1016/j.tcs.2011.08.016

Categories: math.CO

Subjects: 68R15

Keywords: quadratic parry numbers, infinite words, abelian complexity, explicit formula

Tags: journal article

Related articles: Most relevant | Search more

arXiv:1201.2109 [math.CO] (Published 2012-01-10)

Abelian complexity and Abelian co-decomposition

Ondřej Turek

arXiv:0711.0527 [math.CO] (Published 2007-11-04)

How many latin rectangles are there?

arXiv:2010.07353 [math.CO] (Published 2020-10-14)

On the number of partitions of $n$ whose product of the summands is at most $n$

arXiv Analytics