Clusters of repetition roots: single chains

DOI10.1007/978-3-030-67731-2_29zbMath1490.68172OpenAlexW3124843785MaRDI QIDQ831839

Szilárd Zsolt Fazekas, Robert Mercaş

Publication date: 24 March 2022

Full work available at URL: https://figshare.com/articles/conference_contribution/Clusters_of_repetition_roots_single_chains/13990997

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Square network on a word, Clusters of repetition roots forming prefix chains

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum number of distinct and nonequivalent nonstandard squares in a word
• How many double squares can a string contain?
• Avoiding large squares in infinite binary words
• A generalization of Thue freeness for partial words
• On repetitions of blocks in binary sequences
• How many squares can a string contain?
• How many squares must a binary sequence contain?
• The maximal number of cubic runs in a word
• Squares, cubes, and time-space efficient string searching
• Prefix frequency of lost positions
• A note on the number of squares in a word
• A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
• A Stronger Square Conjecture on Binary Words
• NUMBER OF OCCURRENCES OF POWERS IN STRINGS
• Algorithms on Strings, Trees and Sequences
• The “Runs” Theorem