University of Cambridge > Talks.cam > Combinatorics Seminar > Convexity Spaces and Extremal Set Theory

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Convexity Spaces and Extremal Set Theory

Download to your calendar using vCal

  • UserBoris Bukh (University of Cambridge)
  • ClockThursday 24 February 2011, 15:00-16:00
  • HouseMR12.

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:

Note that ex-directory lists are not shown.

Other lists

Cambridge Science Festival Cambridge Infectious Diseases Cripps Court Auditorium Cripps Court Magdalene College Cambridge CB4 3AD

Other talks

Cooperation in Nature Group Work Title to be confirmed Proteomics: Expression Analysis and Subcellular Localisation Discussion II continued Title to be confirmed
 

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