String Rearrangement Inequalities and a Total Order Between Primitive Words

Ruixi Luo, Taikun Zhu, Kai Jin

We study the following rearrangement problem: Given $n$ words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively).…