![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Boris Bukh (UCLA)
Friday 23 January 2009, 16:30-17:30
Geometric Selection Theorems
- 👤 Speaker: Boris Bukh (UCLA)
- 📅 Date & Time: Friday 23 January 2009, 16:30 - 17:30
- 📍 Venue: MR13, CMS
Questions? Contact
Ben Green
Abstract
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.
Series This talk is part of the Discrete Analysis Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- Discrete Analysis Seminar
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- MR13, CMS
- School of Physical Sciences
Note: Ex-directory lists are not shown.