New lower bounds for the maximum number of runs in a string

Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Citations (Scopus)

Abstract

We show a new lower bound for the maximum number of runs in a string. We prove that for any ε > 0, (α - ε)n is an asymptotic lower bound, where α = 174719/184973 ≈ 0.944565. It is superior to the previous bound 3/(1 + √5) ≈ 0.927 given by Franěk et al. [6,7]. Moreover, our construction of the strings and the proof is much simpler than theirs.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2008
Pages140-145
Number of pages6
Publication statusPublished - 2008 Dec 1
EventPrague Stringology Conference 2008, PSC 2008 - Prague, Czech Republic
Duration: 2008 Sep 12008 Sep 3

Publication series

NameProceedings of the Prague Stringology Conference 2008

Other

OtherPrague Stringology Conference 2008, PSC 2008
CountryCzech Republic
CityPrague
Period08/9/108/9/3

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'New lower bounds for the maximum number of runs in a string'. Together they form a unique fingerprint.

Cite this