{'fraction_non_alphanumeric': 0.03082437275985663, 'fraction_numerical': 0.004301075268817204, 'mean_word_length': 4.965811965811966, 'pattern_counts': {'":': 0, '<': 6, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes

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-vectors of simplicial polytopes, we show that h-vectors of pure rank-d simplicial complexes that have this property satisfy ho < h1 < < h[d/2] and hi < hd-i for 0 < i < [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 eardecomposition called a PS ear-decomposition. This enables us to construct an associated M-shellable poset, whose set of rank-numbers is the h-vector of the matroid complex. This results in a combinatorial proof of a conjecture of Hibi [17] that the h-vector of a matroid complex satisfies the above two sets of inequalities.