Recent progress on the diameter of simplicial complexes and polyhedra
- Date
- Nov 27, 2013
- Time
- 5:00 PM - 6:00 PM
- Speaker
- Prof. Dr. Francisco Santos
- Affiliation
- Universidad de Cantabria
- Series
- TUD Dresdner Mathematisches Seminar
- Language
- en
- Main Topic
- Mathematik
- Other Topics
- Mathematik
- Host
- Prof. Dr. U. Brehm
- Description
- The Hirsch conjecture, posed in 1957, stated that the graph of a $d$-dimensional polytope or polyhedron with $n$ facets could not have diameter greater than $n - d$. The conjecture itself has been disproved, but what we know about the underlying question is quite scarce. Most notably, no polynomial upper bound is known for the diameters that were conjectured to be linear. In contrast, no polyhedron violating the conjecture by more than 25% is known. In this talk we review several recent attempts and progress on the question. Some of them work in the world of polyhedra or (more often) bounded polytopes, but some try to shed light on the question by generalizing it to simplicial complexes. In particular, we show that the maximum diameter of arbitrary simplicial complexes is in $n^{Theta(d)}$ and we summarize the main ideas in the polymath 3 project, a web-based collective effort trying to prove an upper bound of type nd for the diameters of polyhedra and of more general objects (including, e. g., simplicial manifolds).
- Links
Last modified: Nov 19, 2013, 2:14:39 PM
Location
TUD Willers-Bau (WIL C 307)Zellescher Weg12-1401069Dresden
- Homepage
- https://navigator.tu-dresden.de/etplan/wil/00
Organizer
TUD MathematikWillersbau, Zellescher Weg12-1401069Dresden
- Phone
- 49-351-463 33376
- Homepage
- http://tu-dresden.de/mathematik
Legend
- Biology
- Chemistry
- Civil Eng., Architecture
- Computer Science
- Economics
- Electrical and Computer Eng.
- Environmental Sciences
- for Pupils
- Law
- Linguistics, Literature and Culture
- Materials
- Mathematics
- Mechanical Engineering
- Medicine
- Physics
- Psychology
- Society, Philosophy, Education
- Spin-off/Transfer
- Traffic
- Training
- Welcome
