University of Cambridge > Talks.cam > Combinatorics Seminar > Measurable circle squaring

Measurable circle squaring

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

  • UserOleg Pikhurko (University of Warwick)
  • ClockThursday 03 December 2015, 14:30-15:30
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity