- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Bounds for Folkmanâ s Theorem
Open Collections
BIRS Workshop Lecture Videos
Featured Collection
BIRS Workshop Lecture Videos
Bounds for Folkmanâ s Theorem Narayanan, Bhargav
Description
Folkmanâ s theorem asserts that in any red-blue colouring of [N], there is an n-set all of whose finite sums are the same colour. How large must N be in terms of n Improving on Erdosâ Spencer from the 80s, Iâ ll show that N must be at least doubly exponential in n.
Item Metadata
| Title |
Bounds for Folkmanâ s Theorem
|
| Creator | |
| Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
| Date Issued |
2019-11-12T12:01
|
| Description |
Folkmanâ s theorem asserts that in any red-blue colouring of [N], there is an n-set all of whose finite sums are the same colour. How large must N be in terms of n Improving on Erdosâ Spencer from the 80s, Iâ ll show that N must be at least doubly exponential in n.
|
| Extent |
27.0 minutes
|
| Subject | |
| Type | |
| File Format |
video/mp4
|
| Language |
eng
|
| Notes |
Author affiliation: Rutgers University
|
| Series | |
| Date Available |
2020-05-11
|
| Provider |
Vancouver : University of British Columbia Library
|
| Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
| DOI |
10.14288/1.0390444
|
| URI | |
| Affiliation | |
| Peer Review Status |
Unreviewed
|
| Scholarly Level |
Researcher
|
| Rights URI | |
| Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International