Maximum number of distinct and nonequivalent nonstandard squares in a word

DOI10.1016/j.tcs.2016.08.010zbMath1350.68217OpenAlexW2964032721MaRDI QIDQ313973

Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen

Publication date: 12 September 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.08.010

zbMATH Keywords

abelian squaresorder-preserving squaresparameterized squares

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Abelian-square-rich words ⋮ Clusters of repetition roots: single chains ⋮ Abelian combinatorics on words: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abelian powers and repetitions in Sturmian words
• Order-preserving indexing
• Extracting powers and periods in a word from its runs structure
• A linear time algorithm for consecutive permutation pattern matching
• How many double squares can a string contain?
• Problems in between words and abelian words: \(k\)-abelian avoidability
• On the context-freeness of the set of words containing overlaps
• Repetitions in strings: algorithms and combinatorics
• Strongly non-repetitive sequences and progression-free sets
• How many squares can a string contain?
• Bounds on arithmetic projections, and applications to the Kakeya conjecture
• Linear time algorithms for finding and representing all the tandem repeats in a string
• Parameterized pattern matching: Algorithms and applications
• A note on the number of squares in a word
• Order-preserving matching
• Squares in partial words
• A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
• Subquadratic-Time Algorithms for Abelian Stringology Problems
• Non-standard stringology
• The Maximum Number of Squares in a Tree
• Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
• Words with the Maximum Number of Abelian Squares
• Abelian squares are avoidable on 4 letters

This page was built for publication: Maximum number of distinct and nonequivalent nonstandard squares in a word