arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.03043cs.DMmath.CO
收藏

随机拼图的唯一重构阈值

Unique reconstruction threshold for random jigsaw puzzles

Rajko Nenadov, Pascal Pfister, Angelika Steger

摘要:

通过将$n^2$正方形块排列成$n \times n$网格并将$q$可用颜色中的一种均匀随机地分配给块的每个边缘,并限制接触边缘接收相同的颜色,来构造随机拼图。我们表明,如果$q = o(n)$,然后与高概率这样的难题没有一个唯一的解决方案,而如果$q \ge n^{1 + \varepsilon}$的任何常数$\varepsilon > 0$,那么解决方案是唯一的。这解决了Mossel和Ross的一个猜想(Shotgun assembly of labeled graphs,arXiv:1504.07682)。

英文摘要:

A random jigsaw puzzle is constructed by arranging $n^2$ square pieces into an $n \times n$ grid and assigning to each edge of a piece one of $q$ available colours uniformly at random, with the restriction that touching edges receive the same colour. We show that if $q = o(n)$ then with high probability such a puzzle does not have a unique solution, while if $q \ge n^{1 + \varepsilon}$ for any constant $\varepsilon > 0$ then the solution is unique. This solves a conjecture of Mossel and Ross (Shotgun assembly of labeled graphs, arXiv:1504.07682).

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

↑