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

DOI10.1016/j.dam.2016.09.036zbMath1364.68316OpenAlexW2532956696WikidataQ123201334 ScholiaQ123201334MaRDI QIDQ516879

Antoine Deza, Frantisek Franek

Publication date: 15 March 2017

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

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

zbMATH Keywords

stringsruns\(d\)-step approachLyndon root

Mathematics Subject Classification ID

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

Cites Work

• A computational substantiation of the \(d\)-step approach to the number of distinct squares problem
• A computational framework for determining run-maximal strings
• A counterexample to the Hirsch conjecture
• How many double squares can a string contain?
• A \(d\)-step approach to the maximum number of distinct squares and runs in strings
• Maximal repetitions in strings
• How many runs can a string contain?
• A continuous \(d\)-step conjecture for polytopes
• How many squares can a string contain?
• The number of runs in a string
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
• Towards a Solution to the “Runs” Conjecture
• AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
• Not So Many Runs in Strings
• A Series of Run-Rich Strings
• The “Runs” Theorem
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound

This page was built for publication: Bannai et al. method proves the \(d\)-step conjecture for strings