15:30
Multidimensional Erdős-Szekeres theorem
Abstract
The classical Erdős-Szekeres theorem dating back almost a hundred years states that any sequence of $(n-1)^2+1$ distinct real numbers contains a monotone subsequence of length $n$. This theorem has been generalised to higher dimensions in a variety of ways but perhaps the most natural one was proposed by Fishburn and Graham more than 25 years ago. They raise the problem of how large should a $d$-dimesional array be in order to guarantee a "monotone" subarray of size $n \times n \times \ldots \times n$. In this talk we discuss this problem and show how to improve their original Ackerman-type bounds to at most a triple exponential. (Joint work with M. Bucic and T. Tran)
Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.