Upper bound for the generalized repetition threshold

Details Upper bound for the generalized repetition threshold Upper bound for the generalized repetition threshold

2010-09-22

arxiv.org/abs/1009.4454v2

Mathematics

Combinatorics

Scientific paper

Let $A$ be an $a$-letter alphabet. We consider fractional powers of $A$-strings: if $x$ is a $n$-letter string, $x^r$ is a prefix of $xxxx...$ having length $nr$. Let $l$ be a positive integer. Ilie, Ochem and Shallit defined $R(a,l)$ as the infimum of reals $r>1$ such that there exist a sequence of $A$-letters without factors (substrings) that are fractional powers $x^{r'}$ where $x$ has length at least $l$ and $r'\ge r$. We prove that $1+\frac{1}{la}\le R(a,l)\le 1+\frac{c}{la}$ for some constant $c$.

Affiliated with

Also associated with

No associations

Rating

Upper bound for the generalized repetition threshold 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 Upper bound for the generalized repetition threshold, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper bound for the generalized repetition threshold will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-638514