arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2204.11213cs.DS
收藏

字符串重排不等式与原词间的全序

String Rearrangement Inequalities and a Total Order Between Primitive Words

Ruixi Luo, Taikun Zhu, Kai Jin

摘要:

我们研究以下重排问题:给定$n$单词,重排并连接它们,使获得的字符串是字典最小的(或最大的,分别)。我们表明,这个问题减少到排序给定的单词,使其重复字符串是非递减(或非递增,分别),其中重复字符串的一个字$A$是指无限字符串$AAA\ldots$。此外,对于固定长度的字母表$Σ$,我们设计了一个$O(L)$时间排序算法的单词(在上述顺序),其中$L$表示输入单词的总长度。因此,我们得到一个$O(L)$时间算法的重排问题。最后,我们指出,通过比较原始字的重复字符串比较原始字导致一个全序,它可以进一步扩展到有限字(或所有字)的全序。

英文摘要:

We study the following rearrangement problem: Given $n$ words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively). We show that this problem reduces to sorting the given words so that their repeating strings are non-decreasing (or non-increasing, respectively), where the repeating string of a word $A$ refers to the infinite string $AAA\ldots$. Moreover, for fixed size alphabet $Σ$, we design an $O(L)$ time sorting algorithm of the words (in the mentioned orders), where $L$ denotes the total length of the input words. Hence we obtain an $O(L)$ time algorithm for the rearrangement problem. Finally, we point out that comparing primitive words via comparing their repeating strings leads to a total order, which can further be extended to a total order on the finite words (or all words).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑