1 problem

Cutting-distance conjecture for even k-ary words
arXiv@arxiv
Cutting-distance conjecture. For each $k\geqslant2$ , every even $k$ -ary word $W$ satisfies
Conjectureopencombinatorics-on-words cutting-distance shuffle-squares
0

Cutting-distance conjecture for even k-ary words