随机拼图的散弹枪装配
Shotgun Assembly of Random Jigsaw Puzzles
摘要:
在最近的一项工作中,莫塞尔和罗斯考虑了一个随机拼图游戏的猎枪组装问题。他们的模型由一个谜题组成--一个$n\times n$网格,其中每个顶点都被视为一块的中心。他们假设,每个顶点附近的四个边缘,被分配一个$q$颜色(对应于“夹具”,或切割形状)均匀随机。莫塞尔和罗斯问道:$q = q(n)$应该有多大,才能以高概率唯一地组合出给定的单个方块?他们表明,如果是$q = ω(n^2)$,那么这个谜题可以以高概率唯一地组装,而如果是$q = o(n^{2/3})$,那么这个谜题不能以高概率唯一地组装。在这里,我们提高了上界,并表明,对于任何$\eps > 0$,难题可以组装唯一的高概率,如果$q \geq n^{1+\eps}$。证明使用了$n^{Θ(1/\eps)}$运行时间算法。
英文摘要:
In a recent work, Mossel and Ross considered the shotgun assembly problem for a random jigsaw puzzle. Their model consists of a puzzle - an $n\times n$ grid, where each vertex is viewed as a center of a piece. They assume that each of the four edges adjacent to a vertex, is assigned one of $q$ colors (corresponding to "jigs", or cut shapes) uniformly at random. Mossel and Ross asked: how large should $q = q(n)$ be so that with high probability the puzzle can be assembled uniquely given the collection of individual tiles? They showed that if $q = ω(n^2)$, then the puzzle can be assembled uniquely with high probability, while if $q = o(n^{2/3})$, then with high probability the puzzle cannot be uniquely assembled. Here we improve the upper bound and show that for any $\eps > 0$, the puzzle can be assembled uniquely with high probability if $q \geq n^{1+\eps}$. The proof uses an algorithm of $n^{Θ(1/\eps)}$ running time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。