arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.14397math.COcs.DS
收藏

判定袜子可足排序性及最小2-有界不可足排序袜子序列

Deciding Foot-sortability and Minimal 2-bounded Non-foot-sortable Sock Orderings

Hung-Hsun Hans Yu

AI总结:

本文解决每种颜色至多出现两次的袜子序列的可足排序性判定问题,提出O(N log N)时间的快速算法,并刻画最小2-有界不可足排序序列。

摘要:

袜子序列是由不同颜色的袜子组成的序列。若一个袜子序列可以通过一个栈进行排序,使得相同颜色的袜子形成连续块,则该序列是可足排序的。判定给定袜子序列是否可足排序的问题最初由Defant和Kravitz考虑,他们解决了无对齐2-均匀袜子序列的情形。本文在更一般的设置中解决了该问题,其中每种颜色在袜子序列中至多出现两次。论证的一个关键组成部分是一个快速算法,该算法在O(N log N)时间内判定长度为N的袜子序列的可足排序性,这本身也是一个有趣的结果。

英文摘要:

A sock ordering is a sequence of socks with different colors. A sock ordering is foot-sortable if the sequence of socks can be sorted by a stack so that socks with the same color form a contiguous block. The problem of deciding whether a given sock ordering is foot-sortable was first considered by Defant and Kravitz, who resolved the case for alignment-free 2-uniform sock orderings. In this paper, we resolve the problem in a more general setting, where each color appears in the sock ordering at most twice. A key component of the argument is a fast algorithm that determines the foot-sortability of a sock ordering of length $N$ in time $O(N\log N)$, which is also an interesting result on its own.

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

↑