Papers
Topics
Authors
Recent
Search
2000 character limit reached

Convex-Ear Decompositions and the Flag h-Vector

Published 13 Jun 2010 in math.CO | (1006.2561v1)

Abstract: We prove a theorem allowing us to find convex-ear decompositions for rank-selected subposets of posets that are unions of Boolean sublattices in a coherent fashion. We then apply this theorem to geometric lattices and face posets of shellable complexes, obtaining new inequalities for their h-vectors. Finally, we use the latter decomposition to prove new inequalities for the flag h-vectors of face posets of Cohen-Macaulay complexes.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.