Unique reconstruction threshold for random jigsaw puzzles
From MaRDI portal
Abstract: A random jigsaw puzzle is constructed by arranging square pieces into an grid and assigning to each edge of a piece one of available colours uniformly at random, with the restriction that touching edges receive the same colour. We show that if then with high probability such a puzzle does not have a unique solution, while if for any constant then the solution is unique. This solves a conjecture of Mossel and Ross (Shotgun assembly of labeled graphs, arXiv:1504.07682).
Recommendations
Cited in
(11)- Solving scramble squares puzzles with repetitions
- Shotgun assembly of Erdős-Rényi random graphs
- No easy puzzles: hardness results for jigsaw puzzles
- Finding a unique solution to Radon-Kaczmarz puzzles
- Shotgun assembly of random jigsaw puzzles
- Solving jigsaw puzzles by the graph connection Laplacian
- A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles
- Shotgun reconstruction in the hypercube
- An algorithm to recover shredded random matrices
- Shotgun assembly of unlabeled Erdős-Rényi graphs
- Reconstructing random pictures
This page was built for publication: Unique reconstruction threshold for random jigsaw puzzles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360828)