Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, May 02, 2013, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Uli Wagner (Institute of Science and Technology Austria)

Helly's theorem, a basic result in convex geometry, asserts the following: If F={C_{1},...,C_{n}} is a finite family of convex sets in **R**^{d} whose intersection is empty then there exists a "certificate of bounded size" for this, namely a subfamily G of F of d+1 sets whose intersection is already empty.

This result has led to a whole line of research that investigates Helly-type theorems. In general, the *Helly number* of a finite family F of sets is defined as the smallest integer h=h(F) such that if the intersection of all sets in F is empty, then there is already some subfamily of at most h sets whose intersection is empty. The aim in this line of business is to find conditions on F that guarantee that the Helly number is bounded (independently of n, the size of the family).

One important class of Helly-type theorems investigates *topological conditions* on the sets in F and their intersections. One way of measuring the topological complexity of a subset of **R**^{d} is in terms of its *Betti numbers* b_{k}, which, roughly speaking, measure the number of k-dimensional "holes" in the set.

Here, we present the following Helly-type result that, qualitatively, unifies and generalizes a number of Helly-type theorems due to Amenta, Matousek, Kalai and Meshulam, and others.

**Theorem.** Suppose that F is a finite family of arbitrary sets in **R**^{d} such that the intersection of any subfamily of F has the first d/2 Betti numbers b_{0},...,b_{d/2-1} bounded by some number B. Then the Helly number of F is bounded by some number h=h(d,B) that depends only on d and on B.

Joint work with X. Goaoc, P. Paták, Z. Safernová, and M. Tancer

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login