Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, September 15, 2020, 12:15 pm

**Duration**: 30 minutes

**Location**: Zoom: conference room

**Speaker**: Maxime Larcher

In 2017, Mossel and Ross introduced the *Random Jigsaw Puzzle Problem*: if we create a puzzle by cutting all the edges of an *n x n* grid u.a.r. using one of *q* shapes, for which choice of *q = q(n)* can we guarantee w.h.p. that there is a unique solution to the puzzle?

In a series of paper, Mossel and Ross (2017), Nenadov, Pfister and Steger (2017), and Martinsson (2019) offered some answers to this question. Parts of the proofs are based on Martinsson's observation that for *q* small enough, the number of ways of cutting a board is greater than the number of possible collection.

A question that naturally arises from this observation is whether a typical collection of pieces (taken from the whole set of collections, not necessarily obtained by cutting a grid) has at least one solution. We show that, when *q < O(n ^{1/2} / log^{1/4} n)*, if the number of pieces of each type is close to its expectation then the puzzle can be solved in expected polynomial time. This is also true if we impose the shapes of the edges on the boundary of the grid, provided this satisfies some trivial condition.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login