Corrine Yap, Rutgers University

Abstract

Reconstruction problems ask whether or not it is possible to uniquely build a discrete structure from the collection of its substructures of a fixed size. Some well-studied examples include graphs, abelian groups, and geometric sets. In this talk, we'll consider the reconstruction of random pictures (n-by-n grids with binary entries) and prove a nearly-sharp threshold. Our main proof technique is an interface argument commonly used in percolation theory.

Presented via Zoom - Meeting ID: 984 4140 9199

https://rutgers.zoom.us/j/98441409199

Password: 715004