Sciweavers

64
Voted
LATA
2009
Springer

A Series of Run-Rich Strings

15 years 3 months ago
A Series of Run-Rich Strings
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymptotic behavior of the numbers of runs in the strings defined by any recurrence formula, and show the lower bound can be improved further to 0.94457571235.
Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, A
Added 20 May 2010
Updated 20 May 2010
Type Conference
Year 2009
Where LATA
Authors Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara
Comments (0)