Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes
Manoj Chari
Source record
Source: Crossref
Published: Jan 1, 1997
DOI: 10.1090/s0002-9947-97-01921-1
Open original source ↗Source abstract
This paper introduces two new decomposition techniques which are related to the classical notion of shellability of simplicial complexes, and uses the existence of these decompositions to deduce certain numerical properties for an associated enumerative invariant. First, we introduce the notion of M-shellability , which is a generalization to pure posets of the property of shellability of simplicial complexes, and derive inequalities that the rank-numbers of M-shellable posets must satisfy. We also introduce a decomposition property for simplicial complexes called a convex ear-decomposition , and, using results of Kalai and Stanley on h h -vectors of simplicial polytopes, we show that h h -vectors of pure rank- d d simplicial complexes that have this property satisfy h 0 ≤ h 1 ≤ ⋯ ≤ h [ d / 2 ] h_{0} \leq h_{1} \leq \cdots \leq h_{[d/2]} and h i ≤ h d − i h_{i} \leq h_{d-i} for 0 ≤ i ≤ [ d / 2 ] 0 \leq i \leq [d/2] . We then show that the abstract simplicial complex formed by the collection of independent sets of a matroid (or matroid complex ) admits a special type of convex ear-decomposition called a PS ear-decomposition . This enables us to construct an associated M-shellable poset, whose set of rank-numbers is the h h -vector of the matroid complex. This results in a combinatorial proof of a conjecture of Hibi [Face numbers inequalities for matroid complexes and Cohen-Macaulay types of Stanley-Reisner rings of distributive lattices, Pacific Journal of Math. 154 (1992), 253-264] that the h h -vector of a matroid complex satisfies the above two sets of inequalities.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.