BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The length of a 2-increasing sequence of integer triples - Jason L
 ong\, DPMMS
DTSTART:20161017T130000Z
DTEND:20161017T134000Z
UID:TALK67712@talks.cam.ac.uk
CONTACT:Jack Smith
DESCRIPTION:We will consider the following deceptively simple question\, f
 ormulated recently by Po Shen Loh who connected it to an open problem in R
 amsey Theory. Define the '2-less than' relation on the set of triples of i
 ntegers by saying that a triple x is 2-less than a triple y if x is less t
 han y in at least two coordinates. What is the maximal length of a sequenc
 e of triples taking values in {1\,...\,n} which is totally ordered by the 
 '2-less than' relation?\n\nIn his paper\, Loh uses the triangle removal le
 mma to improve on the trivial upper bound of n^2^ by a factor of log*(n)\,
  and conjectures that the truth should be of order n^3/2^. The gap between
  these bounds has proved to be surprisingly resistant. We shall discuss jo
 int work with Tim Gowers\, giving some developments towards this conjectur
 e and a wide array of natural extensions of the problem. Many of these ext
 ensions remain open.
LOCATION:MR3\, CMS
END:VEVENT
END:VCALENDAR