Clusters of repetition roots: single chains

DOI10.1007/978-3-030-67731-2_29MaRDI QIDQ831839zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 3864532
• Repetitions in strings: algorithms and combinatorics
• How many squares can a string contain?
• Combinatorial Pattern Matching
• A New Periodicity Lemma

Cites work

• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• A generalization of Thue freeness for partial words
• 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
• Algorithms on Strings, Trees and Sequences
• Avoiding large squares in infinite binary words
• Counting distinct squares in partial words
• How many double squares can a string contain?
• How many squares can a string contain?
• How many squares must a binary sequence contain?
• Maximum number of distinct and nonequivalent nonstandard squares in a word
• NUMBER OF OCCURRENCES OF POWERS IN STRINGS
• On repetitions of blocks in binary sequences
• Prefix frequency of lost positions
• Squares, cubes, and time-space efficient string searching
• The ``runs theorem
• The maximal number of cubic runs in a word

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831839)