University of Cambridge > Talks.cam > DPMMS PhD student colloquium > The length of a 2-increasing sequence of integer triples

The length of a 2-increasing sequence of integer triples

Add to your list(s) Download to your calendar using vCal

  • UserJason Long, DPMMS
  • ClockMonday 17 October 2016, 14:00-14:40
  • HouseMR3, CMS.

If you have a question about this talk, please contact Jack Smith.

We will consider the following deceptively simple question, formulated recently by Po Shen Loh who connected it to an open problem in Ramsey Theory. Define the ‘2-less than’ relation on the set of triples of integers by saying that a triple x is 2-less than a triple y if x is less than y in at least two coordinates. What is the maximal length of a sequence of triples taking values in {1,...,n} which is totally ordered by the ‘2-less than’ relation?

In his paper, Loh uses the triangle removal lemma to improve on the trivial upper bound of n2 by a factor of log*(n), and conjectures that the truth should be of order n3/2. The gap between these bounds has proved to be surprisingly resistant. We shall discuss joint work with Tim Gowers, giving some developments towards this conjecture and a wide array of natural extensions of the problem. Many of these extensions remain open.

This talk is part of the DPMMS PhD student colloquium series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity