University of Cambridge > > Discrete Analysis Seminar > Geometric Selection Theorems

Geometric Selection Theorems

Add to your list(s) Download to your calendar using vCal

  • UserBoris Bukh (UCLA)
  • ClockFriday 23 January 2009, 16:30-17:30
  • HouseMR13, CMS.

If you have a question about this talk, please contact Ben Green.

In combinatorial geometry one frequently wants to select a point or a set of points that meets many simplices of a given family. The two examples are choosing a point in many simplices spanned by points of some P in R^d, and choosing a small set of points which meets the convex hull of every large subset of P (the weak epsilon-net problem). I will present a new class of constructions that yield the first nontrivial lower bound on the weak epsilon-net problem, and improve the best bounds for several other selection problems. Joint work with Jiri Matousek and Gabriel Nivasch.

This talk is part of the Discrete Analysis Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity