Measurable circle squaring

Add to your list(s) Download to your calendar using vCal

• Oleg Pikhurko (University of Warwick)
• Thursday 03 December 2015, 14:30-15:30
• MR12.

If you have a question about this talk, please contact Andrew Thomason.

In 1990 Laczkovich proved that one can split a disk into finitely many parts and move them to form a partition of a square, thus solving the long-standing Tarski’s circle squaring problem. I will discuss our result with András Máthé and Łukasz Grabowski that, additionally, all parts can be made Lebesgue measurable. This is achieved by showing that some analytic version of the augmenting path algorithm stabilises almost everywhere.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.