Combinatorics of circle squaring
Oleg Pikhurko (University of Warwick)
Abstract: Two sets in a metric space are called equidecomposable if one set can be partitioned into finitely many pieces that can be rearranged by isometries to form a partition of the other set. I will discuss how combinatorial ideas and methods helped in various results on "constructive" equidecompositions. In particular, I will present our joint result with Andras Mathe and Jonathan Noel that a disk and a square in the Euclidean plane are equidecomposable with Jordan measurable pieces.
combinatoricsprobability
Audience: researchers in the topic
Extremal and probabilistic combinatorics webinar
Series comments: We've added a password: concatenate the 6 first prime numbers (hence obtaining an 8-digit password).
Organizers: | Jan Hladky*, Diana Piguet, Jan Volec*, Liana Yepremyan |
*contact for this listing |