Abstract

We consider the shotgun assembly problem for a random jigsaw puzzle, introduced by Mossel and Ross (2015). Their model consists of a puzzle—an n×n grid, where each vertex is viewed as a center of a piece. Each of the four edges adjacent to a vertex is assigned one of q colors (corresponding to “jigs,” or cut shapes) uniformly at random. Unique assembly refers to there being only one puzzle (the original one) that is consistent with the collection of individual pieces. We show that for any ε>0, if q ≥ n1+ε, then unique assembly holds with high probability. The proof uses an algorithm that assembles the puzzle in time nΘ(1/ε).22

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.