New Lower Bounds for the Maximum Number of Runs in a String

Simple item page
dc.creatorKusano, Kazuhiko
dc.creatorMatsubara, Wataru
dc.creatorIshino, Akira
dc.creatorBannai, Hideo
dc.creatorShinohara, Ayumi
dc.date2008-04-08
dc.date.accessioned2026-07-07T12:18:12Z
dc.date.available2026-07-07T12:18:12Z
dc.descriptionWe show a new lower bound for the maximum number of runs in a string. We prove that for any e > 0, (a -- e)n is an asymptotic lower bound, where a = 56733/60064 = 0.944542. It is superior to the previous bound 0.927 given by Franek et al. Moreover, our construction of the strings and the proof is much simpler than theirs.
dc.identifierhttps://arxiv.org/abs/0804.1214
dc.identifierhttp://arxiv.org/abs/0804.1214
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212328
dc.subjectDiscrete Mathematics
dc.subjectG.2.1
dc.titleNew Lower Bounds for the Maximum Number of Runs in a String
dc.typetext

Files

Collections

arXiv