Words with the Maximum Number of Abelian Squares

DOI10.1007/978-3-319-23660-5_11zbMath1338.68229arXiv1506.03562OpenAlexW2963889765MaRDI QIDQ3449363

Gabriele Fici, Filippo Mignosi

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

abelian squareabelian-square rich worduniformly abelian-square rich word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Abelian-square-rich words ⋮ Maximum number of distinct and nonequivalent nonstandard squares in a word

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• How many squares can a string contain?
• Limit values of the recurrence quotient of Sturmian sequences
• Palindrome complexity bounds for primitive substitution sequences
• Infinite words with linear subword complexity
• Enumeration of factors in the Thue-Morse word
• A note on the number of squares in a word
• On the average number of regularities in a word
• Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
• Cyclic Complexity of Words
• Repetitions in the Fibonacci infinite word
• Linearly recurrent subshifts have a finite number of non-periodic subshift factors
• Abelian squares are avoidable on 4 letters
• Abelian Repetitions in Sturmian Words

This page was built for publication: Words with the Maximum Number of Abelian Squares