BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20250813T081834EDT-6380CDcvGV@132.216.98.100
DTSTAMP:20250813T121834Z
DESCRIPTION:Title: Reconstructing Random Pictures.\n\nAbstract: Reconstruct
 ion problems ask whether or not it is possible to uniquely build a discret
 e structure from the collection of its substructures of a fixed size. This
  question has been explored in a wide range of settings\, most famously wi
 th graphs and the resulting Graph Reconstruction Conjecture due to Kelly a
 nd Ulam\, but also including geometric sets\, jigsaws\, abelian groups. In
  this talk\, we'll consider the reconstruction of random pictures (n-by-n 
 grids with binary entries) from the collection of its k-by-k subgrids and 
 prove a nearly-sharp threshold for k = k(n). Our main proof technique is a
 n adaptation of the Peierls contour method from statistical physics.\n\nJo
 int work with Bhargav Narayanan.\n
DTSTART:20230202T163000Z
DTEND:20230202T173000Z
LOCATION:Room 1214\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue
  Sherbrooke Ouest
SUMMARY:Corrine Yap (Rutgers)
URL:/mathstat/channels/event/corrine-yap-rutgers-34571
 6
END:VEVENT
END:VCALENDAR