Return to Colloquia & Seminar listing
On Tverberg's Partition Theorem
Student-Run Research| Speaker: | Shmuel Onn, Technion - Israel Institute of Technology and UC Davis |
| Location: | 693 Kerr |
| Start time: | Wed, Nov 21 2001, 12:00PM |
Description
Helge Tverberg proved (1965) a remarkable theorem on intersection patterns
of partitions of point configurations, which inaugurated a new branch of
combinatorial geometry with by now many variations and applications.
I'll describe a beautiful proof of this theorem (1992); its relations to map
coloring; a recent resolution of a problem about the core of a configuration,
using a construction of Petersen of (by now two) centuries ago and a complexity
result of two decades ago; and mention intriguing open problems in this area.