Monotone arrays and a multidimensional Ramsey Theorem
- 👤 Speaker: Gal Kronenberg (Oxford)
- 📅 Date & Time: Thursday 13 March 2025, 14:30 - 15:30
- 📍 Venue: MR12
Abstract
A foundational result in Ramsey theory appears in a paper of Erdős and Szekeres from 1935: any sequence of n^2 +1 distinct real numbers contains either an increasing or decreasing subsequence of length n+1. This simple result was one of the starting seeds for the development of Ramsey theory. We discuss a generalisation of the Erdős-Szekeres theorem to monotone arrays. We will show how to obtain improvements on a theorem proved by Fishburn and Graham 30 years ago thus confirming a conjecture posed by Bucic, Sudakov, and Tran. More precisely, we will show that a doubly exponential upper bound holds in all dimensions. Finally, we will see how this is intimately connected to a generalisation of Ramsey Theorem on the cartesian product of cliques. Joint work with Antonio Girao and Alex Scott.
Series This talk is part of the Combinatorics Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- Combinatorics Seminar
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Gal Kronenberg (Oxford)
Thursday 13 March 2025, 14:30-15:30