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

排列匹配谜题:年轻的塔尼如何学习计算复杂性

Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity

IIIT Hyderabad(印度信息科学与技术研究所海得拉巴分校);IIT Gandhinagar(印度理工学院甘地纳加尔分校)

Kshitij Gajjar, Neeldhara Misra

AI总结:

本文研究了排列匹配谜题的可解性与计算复杂性,提出了一种基于约束图无环条件的求解方法,并证明了在一般化情况下寻找最小修复是NP难的。

摘要:

我们研究了一类排序匹配谜题,这些谜题被称为排列匹配谜题。在该谜题中,每个行和列的n×n网格都带有顺序约束——升序(A)或降序(D)——目标是用数字1到n²填满网格,使得每行和每列都遵守其约束。我们提供了可解谜题的完整特征化:一个谜题有解当且仅当其关联的约束图是无环的,这转化为一个简单的“最多一个切换”条件在A/D标签上。当存在解时,我们证明其数量由钩长度公式给出。对于无解的谜题,我们提出了一个O(n)的算法,用于计算达到可解配置所需的最小标签翻转次数。最后,我们考虑了一种一般化情况,其中行和列可以指定任意排列而不是简单的顺序,并通过反馈弧集的归约证明在此设置中寻找最小修复是NP难的。

英文摘要:

We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the goal is to fill the grid with the numbers 1 through $n^2$ such that each row and column respects its constraint. We provide a complete characterization of solvable puzzles: a puzzle admits a solution if and only if its associated constraint graph is acyclic, which translates to a simple "at most one switch" condition on the A/D labels. When solutions exist, we show that their count is given by a hook length formula. For unsolvable puzzles, we present an $O(n)$ algorithm to compute the minimum number of label flips required to reach a solvable configuration. Finally, we consider a generalization where rows and columns may specify arbitrary permutations rather than simple orderings, and establish that finding minimal repairs in this setting is NP-complete by a reduction from feedback arc set.

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

↑