A computational substantiation of the d-step approach to the number of distinct squares problem
From MaRDI portal
Publication:313771
DOI10.1016/J.DAM.2016.04.025zbMATH Open1350.68215OpenAlexW2406653127MaRDI QIDQ313771FDOQ313771
Authors: Antoine Deza, Frantisek Franek, 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
Recommendations
- A \(d\)-step approach for distinct squares in strings
- A combinatorial method for computing Steenrod squares
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings
- On the Number of Distinct Squares in Finite Sequences: Some Old and New Results
- scientific article; zbMATH DE number 1160609
- Computing all distinct squares in linear time for integer alphabets
- A Combinatorial Approach to Sums of Two Squares and Related Problems
- The \(d\)-step conjecture and Gaussian elimination
- Publication:4502552
- On generic complexity of the problem of representation of natural numbers by sum of two squares
stringsquare\((d,n-d)\) tablemaximum number of distinct primitively rooted squaresparameterized approachprimitively rooted square
Cites Work
- 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
- A different proof of the Crochemore-Ilie lemma concerning microruns
- 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
- The ``runs theorem
Cited In (4)
This page was built for publication: A computational substantiation of the \(d\)-step approach to the number of distinct squares problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313771)
