Borel Matchings and equidecompositions

Borel Matchings and equidecompositions

Update: 2015-12-23
Share

Description

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.
Comments 
00:00
00:00
x

0.5x

0.8x

1.0x

1.25x

1.5x

2.0x

3.0x

Sleep Timer

Off

End of Episode

5 Minutes

10 Minutes

15 Minutes

30 Minutes

45 Minutes

60 Minutes

120 Minutes

Borel Matchings and equidecompositions

Borel Matchings and equidecompositions

Vincenzo Abete