Title	Ramsey complete sequences
Creator	Conlon, David
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-11-11T09:03
Description	A sequence of positive integers $A$ is said to be entirely Ramsey complete if, for any two-colouring of $A$, every positive integer can be written as the sum of distinct elements of $A$ of the same colour. We show that there exists a constant $C$ and an entirely Ramsey complete sequence $A$ such that $\|A \cap [n]\| \leq C \log^2n$ for all $n$. This is best possible up to the constant and solves a problem ofÂ BurrÂ and Erd\H{o}s. We also discuss several related problems stated by the same authors. Joint work with Jacob Fox.
Extent	39.0 minutes
Subject	Mathematics; Combinatorics; Number theory; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: California Institute of Technology
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2020-05-10
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0390433
URI	http://hdl.handle.net/2429/74382
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos