BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UNIFR/WEBMASTER//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTSTART;VALUE=DATE:20110308T171500
DTEND;VALUE=DATE:20110308T171500
UID:5625@agenda.unifr.ch
DESCRIPTION:Given a probability measure on $R^d$, what is the probability that the\nsimplex spanned by $d+1$ randomly selected points contains the origin\nin its interior? To study this question and its relatives, we\nintroduce the following definition. The overlap number of a finite\n$(d+1)$-uniform hypergraph $H$ is the largest constant $c(H)\in (0,1]$\nsuch that no matter how we map the vertices of $H$ into $R^d$, there\nis a point covered by at least a $c(H)$-fraction  of the simplices\ninduced by the images of its hyperedges. We survey some old and new\nresults related to this concept. Joint work with J. Fox, M. Gromov, V.\nLafforgue, and A. Naor. <br />\n[Invited by Prof. Ruth Kellerhals]
SUMMARY:Prof. Dr. Janos PACH (EPFL): Overlap numbers of hypergraphs
CATEGORIES:Colloque / Congrès / Forum
LOCATION:PER 08\, Phys 2.52\, Chemin du Musée 3\, 1700 Fribourg
URL;VALUE=URI:https://agenda.unifr.ch/e/fr/5625
END:VEVENT
END:VCALENDAR