Journal of Integer Sequences, Vol. 6 (2003), Article 03.3.2

New Lower Bound On The Number of Ternary Square-Free Words

Xinyu Sun
Department of Mathematics
Temple University
Philadelphia, PA 19122

Abstract: A new lower bound on the number of n-letter ternary square-free words is presented: 110^{n/42}, which improves the previous best result of 65^{n/40}.

Full version:  pdf,    dvi,    ps,    latex,     Maple code and sample output    

(Concerned with sequences A006156

Received November 21, 2002; revised version received August 1, 2003. Published in Journal of Integer Sequences August 18, 2003.

Return to Journal of Integer Sequences home page