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

DOI10.1016/J.DAM.2016.09.036MaRDI QIDQ516879zbMATH OpenOpenAlexWikidataFDO

Authors 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

\(d\)-step approachLyndon rootrunsstrings

Mathematics Subject Classification ID

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

Recommendations

• Towards a Solution to the “Runs” Conjecture
• The ``runs conjecture
• A d-step approach to the maximum number of distinct squares and runs in strings
• The runs theorem and beyond
• The ``runs theorem

Cites work

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

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

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