Clusters of repetition roots forming prefix chains

DOI10.1007/978-3-031-13257-5_4OpenAlexW4299714825MaRDI QIDQ2112177

Szilárd Zsolt Fazekas, Robert Mercaş

Publication date: 18 January 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-13257-5_4

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• How many double squares can a string contain?
• Clusters of repetition roots: single chains
• 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
• Square network on a word
• 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
• Square-Density Increasing Mappings
• NUMBER OF OCCURRENCES OF POWERS IN STRINGS
• Algorithms on Strings, Trees and Sequences
• The “Runs” Theorem

This page was built for publication: Clusters of repetition roots forming prefix chains