Unclustered BWTs of any Length over Non-Binary Alphabets

Gabriele Fici, Estéban Gabory, Giuseppe Romana +1

We prove that for every integer $n>0$ and for every alphabet $\hat{I}{\pounds }_k$ of size $k\ge 3$, there exists a necklace of length $n$ whose Burrows-Wheeler Transform (BWT) is completely…