Journal of Integer Sequences, Vol. 10 (2007), Article 07.3.2

Efficient Lower Bounds on the Number of Repetition-free Words

Roman Kolpakov
Lomonosov Moscow State University
Vorobjovy Gory
119992 Moscow


We propose a new effective method for obtaining lower bounds on the number of repetition-free words over a finite alphabet.

Full version:  pdf,    dvi,    ps,    latex    

(Concerned with sequence A006156.)

Received January 9 2007; revised version received March 8 2007. Published in Journal of Integer Sequences March 20 2007.

Return to Journal of Integer Sequences home page