The critical exponent of the Arshon words
classification
🧮 math.CO
keywords
exponentarshoncriticalattainedequalgeneralizinggivengreater
read the original 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 $n$ is given by (3n-2)/(2n-2), and this exponent is attained at position 1.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.