A computational substantiation of the \(d\)-step approach to the number of distinct squares problem

DOI10.1016/j.dam.2016.04.025zbMath1350.68215OpenAlexW2406653127MaRDI QIDQ313771

Frantisek Franek, Antoine Deza, Mei Jiang

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.04.025

zbMATH Keywords

squarestring\((d,n-d)\) tablemaximum number of distinct primitively rooted squaresparameterized approachprimitively rooted square

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (1)

Bannai et al. method proves the \(d\)-step conjecture for strings

Cites Work

• Unnamed Item
• A computational framework for determining run-maximal strings
• On the structure of run-maximal strings
• How many double squares can a string contain?
• A \(d\)-step approach to the maximum number of distinct squares and runs in strings
• How many squares can a string contain?
• A note on the number of squares in a word
• A d-Step Approach for Distinct Squares in Strings
• The “Runs” Theorem

This page was built for publication: A computational substantiation of the \(d\)-step approach to the number of distinct squares problem