
doi: 10.46298/dmtcs.485
Combinatorics In a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: are they the only ones? If no, what do the infinite smooth words that are also Lyndon words look like? In this paper, we give the answer, proving that the only infinite smooth Lyndon words are m(\a ...
330, lyndon words, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], Lyndon words, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], lyndon factorization, 004, smooth words, Lyndon factorization, extremal smooth words, QA1-939, Mathematics
330, lyndon words, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], Lyndon words, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], lyndon factorization, 004, smooth words, Lyndon factorization, extremal smooth words, QA1-939, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
