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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, October 09, 2003, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Sonoko Moriyama (The University of Tokyo)

Analyze the Structure of all Shellings by h-Assignments

A shellable simplicial complex C has a large number of shellings, each of which is a total order of all facets in C satisfying some combinatorial condition. But the structure of such shellings has never been analyzed, although many researchers have studied shellability itself until today.
In this talk, we propose a new concept, a shellable h-assignment, that represents the fundamental property of each shelling, and show that all shellings in C are classified into a family of disjoint sets Ci corresponding one-to-one to each shellable h-assignment such that each Ci has the structure of an antimatroid.
We also show that a shellable h-assignment can be characterized explicitly.

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

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