The critical exponent of the Arshon words
Combinatorics
2008-04-03 v1
Abstract
Generalizing the results of Thue (for n = 2) and of Klepinin and Sukhanov (for n = 3), we prove that for all n greater than or equal to 2, the critical exponent of the Arshon word of order is given by (3n-2)/(2n-2), and this exponent is attained at position 1.
Cite
@article{arxiv.0804.0258,
title = {The critical exponent of the Arshon words},
author = {Dalia Krieger},
journal= {arXiv preprint arXiv:0804.0258},
year = {2008}
}
Comments
11 pages