(Swansea)

The field of Ramsey theory offers great opportunities for improving our understanding of solving hard combinatorial instances:Try solving the problem instances arising when computing (concrete) Ramsey-type numbers, and understand/improve what's happening.

Van der Waerden numbers are obtained when seeking the smallest n such that partitioning the first n numbers into a given number of parts is guaranteed to contain an arithmetic progression of a given length in some part. We have introduced

In my talk I want to report on our first findings regarding these Green-Tao numbers.

This talk should be accessible by "everybody".

See http://arxiv.org/abs/1004.0653v2 for the underlying report.

Video Conferencing Room - Far-134

Department of Computer Science