Borel Matchings and equidecompositions
Duration: 59 mins 7 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Marks, A [CALTECH (California Institute of Technology)]
Friday 18th December 2015 - 11:30 to 12:30 |
|---|
| Created: | 2015-12-23 14:56 |
|---|---|
| Collection: | Mathematical, Foundational and Computational Aspects of the Higher Infinite |
| Publisher: | Isaac Newton Institute |
| Copyright: | Marks, A |
| Language: | eng (English) |
| 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. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 861.05 MB | View | Download | |
| WebM | 640x360 | 1.0 Mbits/sec | 444.44 MB | View | Download | |
| iPod Video | 480x270 | 522.05 kbits/sec | 226.04 MB | View | Download | |
| MP3 | 44100 Hz | 249.78 kbits/sec | 108.25 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||