A unified approach to Hindman, Ramsey and van der Waerden spaces
Rafa{\l} Filip\'ow, Krzysztof Kowitz, Adam Kwela

TL;DR
This paper unifies various topological spaces related to combinatorial theorems like Hindman's, Ramsey's, and van der Waerden's, providing general theorems, new constructions, and a combinatorial characterization of their relationships.
Contribution
It introduces a unified framework for different types of convergences and spaces, proves general existence theorems, constructs new examples, and characterizes when certain spaces differ using the Katětov order.
Findings
Unified approach to various convergences and spaces
Construction of new spaces with specific properties
Characterization of space relationships via Katětov order
Abstract
For many years, there have been conducting research (e.g. by Bergelson, Furstenberg, Kojman, Kubi\'{s}, Shelah, Szeptycki, Weiss) into sequentially compact spaces that are, in a sense, topological counterparts of some combinatorial theorems, for instance Ramsey's theorem for coloring graphs, Hindman's finite sums theorem and van der Waerden's arithmetical progressions theorem. These spaces are defined with the aid of different kinds of convergences: IP-convergence, R-convergence and ordinary convergence. The first aim of this paper is to present a unified approach to these various types of convergences and spaces. Then, using this unified approach, we prove some general theorems about existence of the considered spaces and show that all results obtained so far in this subject can be derived from our theorems. The second aim of this paper is to obtain new results about the specific…
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
