Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Wednesday, June 22, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Patrick Müller

General lexicographic shellability

A lexicographic shellable complex has the homotopy type of a wedge of spheres and this simplicity of topological structure induces bases for homology and cohomology. EC-shellability is a generalization of EL-shellability and it can be shown that EC-shellability is the most general tool to prove shellability. We introduce the concept of shellability of a poset and its corresponding chain complex. We compare some different lexicographic labelings of the edges in a Hasse diagram.


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

Previous talks by year:   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