Gost festivala: Jing Zhang!

U utorak, 12. maja 2026. imali smo priliku da slušamo odlično i inspirativno predavanje

Jing Zhang (University of North Texas, Denton, USA): A topological rainbow Ramsey theorem

Link predavača: https://jingjzzhang.github.io/

APSTRAKT:

Rainbow Ramsey theorem (sometimes called sub-Ramsey theorem) is a weakening of the usual Ramsey theorem which states for any coloring of pairs of natural numbers such that each color is used not too many times, there exists a restriction of the coloring on pairs of an infinite subset which is injective. Unlike Ramsey theorem failing outright for uncountable sets as shown by Sierpinski, Rainbow Ramsey theorem for uncountable sets can consistently hold, shown by Todorcevic in 1983. Topological Ramsey theory is a study on the strengthening of the usual Ramsey theory that imposes additional topological requirements on the target set. In the mid 2000’s, Abraham, Cummings and Smyth showed that the following topological rainbow Ramsey theorem is consistent: for any coloring on pairs of the second uncountable cardinal where each color is used at most finitely many times, there exists an uncountable set closed in the order topology on which the restriction of the coloring is injective. Later, Garti and Zhang showed that the boundedness requirement can be relaxed so that each color is used at most countably many times, at the cost of a weaker conclusion: the target set is only stationary in its supremum. We demonstrate a joint extension of the Abraham-Cummings-Smyth theorem and Garti-Zhang theorem by showing that it is indeed consistent to start with an countably-bounded coloring while still insisting the target set is closed in the order topology. The proof involves analysis of a family of games analogous to those usually associated with Chang’s conjecture. The talk will be self-contained. This is joint work with Hannes Jakob.