Ultrafilter methods in combinatorics

dc.bibliographicCitation.seriesTitle	Snapshots of Modern Mathematics from Oberwolfach	eng
dc.bibliographicCitation.volume	6/2021
dc.contributor.author	Goldbring, Isaac
dc.date.accessioned	2022-08-05T08:11:38Z
dc.date.available	2022-08-05T08:11:38Z
dc.date.issued	2021
dc.description.abstract	Given a set X, ultrafilters determine which subsets of X should be considered as large. We illustrate the use of ultrafilter methods in combinatorics by discussing two cornerstone results in Ramsey theory, namely Ramsey’s theorem itself and Hindman’s theorem. We then present a recent result in combinatorial number theory that verifies a conjecture of Erdos known as the “B + C conjecture”.	eng
dc.description.version	publishedVersion	eng
dc.identifier.uri	https://oa.tib.eu/renate/handle/123456789/9939
dc.identifier.uri	http://dx.doi.org/10.34657/8977
dc.language.iso	eng
dc.publisher	Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach gGmbH
dc.relation.doi	https://doi.org/10.14760/SNAP-2021-006-EN
dc.relation.essn	2626-1995
dc.rights.license	CC BY-SA 4.0 Unported	eng
dc.rights.uri	https://creativecommons.org/licenses/by-sa/4.0/	eng
dc.subject.ddc	510
dc.subject.other	Algebra and Number Theory	eng
dc.subject.other	Discrete Mathematics and Foundations	eng
dc.title	Ultrafilter methods in combinatorics	eng
dc.type	Report	eng
dc.type	Text	eng
dcterms.extent	10 S.
tib.accessRights	openAccess
wgl.contributor	MFO
wgl.subject	Mathematik
wgl.type	Report / Forschungsbericht / Arbeitspapier

Now showing 1 - 1 of 1