COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Combinatorics Seminar > Increasing Sequences of Integer Triples

## Increasing Sequences of Integer TriplesAdd to your list(s) Download to your calendar using vCal - Jason Long (University of Cambridge)
- Thursday 27 October 2016, 14:30-15:30
- MR12.
If you have a question about this talk, please contact Andrew Thomason. 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 n This talk is part of the Combinatorics Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsOpen Cambridge talks Computer Science Essentials Post-Slavery Societies Workshop## Other talksPolitical Thought, Time and History: An International Conference In search of amethysts, black gold and yellow gold Electron Catalysis Bioengineering conference: Innovation through convergence Stopping the Biological Clock – The Lazarus factor and Pulling Life back from the Edge. Attentional episodes and cognitive control |