Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Tuesday, October 30, 2001, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Carsten Lange

On diameters of some simple polytopes - an approach by Robin Forman

A path between a pair of vertices is a sequence of edges such that consecutive edges share a vertex. The lenght of a path is the number of its edges. What is the the maximal length of a shortest path? The main idea Forman used to obtain an upper bound is varying a hypothetical shortest path. Unfortunately, an assumption on the combinatorics of the polytope is needed.

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

Previous talks by year:   2023  2022  2021  2020  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