Discrete Morse functions from lexicographic orders
University of Washington
refreshments at 3:45pm
A few years ago, Robin Forman established the notion of a discrete Morse
function. We will describe a way of constructing a discrete Morse
function with a relatively small number of critical cells from any
lexicographic order on the saturated chains of a graded poset. This gives
a tool for computing poset Möbius functions via the Morse inequalities
and for proving that certain poset order complexes are collapsible or
homotopy equivalent to a wedge of spheres. In particular, we apply this
to the poset of partitions of a multiset. This is joint work with Eric
Speaker's Contact Info: hersh(at-sign)math.washington.edu
Return to seminar home page
Page loaded on February 24, 2001 at 04:06 PM.
Copyright © 1998-99, Sara C. Billey.
All rights reserved.