April 23, 2008
Kathrin Vorwerk (KTH): Buildings and chamber graph connectivity
Abstract:
Buildings are highly symmetric simplicial complexes with applications in several different areas. The talk will give a brief introduction to the theory of buildings from a mainly geometric point of view. Then, we will have a closer look at the structure of buildings of type A and prove that their chamber graphs have connectivity equal to their minimal degree. It is a conjecture of Anders Björner that this holds for all finite buildings.