A Ramsey-type phenomenon in two and three dimensional simplices
Sumun Iyer

TL;DR
This paper establishes a Ramsey-type theorem for subsets of 2D and 3D simplices, potentially leading to new proofs of extreme amenability in certain homeomorphism groups.
Contribution
It introduces a novel Ramsey-like theorem for low-dimensional simplices, linking combinatorial properties to topological group extreme amenability.
Findings
Developed a Ramsey-like theorem for 2D and 3D simplices
Potential to generalize to higher dimensions
Implications for proving extreme amenability of homeo groups
Abstract
We develop a Ramsey-like theorem for subsets of the two and three-dimensional simplex. A generalization of the combinatorial theorem presented here to all dimensions would produce a new proof that is extremely amenable (a theorem due to Pestov) using general results of Uspenskij on extreme amenability in homeomorphism groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Computability, Logic, AI Algorithms
