Improved bounds on the number of ternary square-free words

Details Improved bounds on the number of ternary square-free words Improved bounds on the number of ternary square-free words

2001-05-29

arxiv.org/abs/math/0105245v3

Journal of Integer Sequences, Vol. 4 (2001), Ar ticle 01.2.7

Mathematics

Combinatorics

17 pages, AMS LaTeX. Paper has been completely rewritten and comprises new results on both lower and upper bounds. The Mathema

Scientific paper

Improved upper and lower bounds on the number of square-free ternary words are obtained. The upper bound is based on the enumeration of square-free ternary words up to length 110. The lower bound is derived by constructing generalised Brinkhuis triples. The problem of finding such triples can essentially be reduced to a combinatorial problem, which can efficiently be treated by computer. In particular, it is shown that the number of square-free ternary words of length n grows at least as 65^(n/40), replacing the previous best lower bound of 2^(n/17).

Affiliated with

Also associated with

No associations

Rating

Improved bounds on the number of ternary square-free words 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 Improved bounds on the number of ternary square-free words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved bounds on the number of ternary square-free words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-196767