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

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

2008-04-08

arxiv.org/abs/0804.1214v1

Computer Science

Discrete Mathematics

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

New Lower Bounds for the Maximum Number of Runs in a String does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New Lower Bounds for the Maximum Number of Runs in a String, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Lower Bounds for the Maximum Number of Runs in a String will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-540112