skip to content
 

Borel Matchings and equidecompositions

Presented by: 
A Marks CALTECH (California Institute of Technology)
Date: 
Friday 18th December 2015 - 11:30 to 12:30
Venue: 
INI Seminar Room 1
Abstract: 
We discuss several results related to the question of when a Borel graph has a Borel matching. Here, the analogue of Hall's matching theorem fails, but there are positive results giving Borel matchings in several contexts if we are willing to discard null or meager sets. We also discuss some applications to geometrical paradoxes. This is joint work with Spencer Unger.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons