The critical exponent of the Arshon words
| dc.creator | Krieger, Dalia | |
| dc.date | 2008-04-01 | |
| dc.date.accessioned | 2026-07-07T09:29:49Z | |
| dc.date.available | 2026-07-07T09:29:49Z | |
| dc.description | 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. | |
| dc.description | 11 pages | |
| dc.identifier | https://arxiv.org/abs/0804.0258 | |
| dc.identifier | http://arxiv.org/abs/0804.0258 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/157926 | |
| dc.subject | Combinatorics | |
| dc.subject | 68R15 | |
| dc.title | The critical exponent of the Arshon words | |
| dc.type | text |