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 > Convexity Spaces and Extremal Set Theory

## Convexity Spaces and Extremal Set TheoryAdd to your list(s) Download to your calendar using vCal - Boris Bukh (University of Cambridge)
- Thursday 24 February 2011, 15:00-16:00
- MR12.
If you have a question about this talk, please contact Andrew Thomason. Tverberg’s theorem asserts that every (r-1)(d+1)+1 points in R^d can be partitioned into r parts whose convex hulls meet at a single point. Radon’s lemma is the special case r=2 of Tverberg’s theorem. Can it be that Radon’s lemma implies Tverberg’s theorem? Eckhoff’s conjecture is that it does. We show that the conjecture is false. In addition, we show that the conjecture is almost true, and explain how this problem relates to interesting questions in extremal set theory. 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 listsEuropean Bioinformatics Institute Type the title of a new list here Conservation seminars## Other talksSpeak white, speak black, speak American Group covariance functions for Gaussian process metamodels with categorical inputs Cohomology of the moduli space of curves Symbolic AI in Computational Biology; applications to disease gene and drug target identification Childhood adversity and chronic disease: risks, mechanisms and resilience. Algorithmic Investigation of Large Biological Data sets |