Biconed graphs, weighted forests, and \(h\)-vectors of matroid complexes
From MaRDI portal
Publication:2665976
DOI10.37236/9849zbMath1478.05018arXiv2005.09138OpenAlexW3216107441MaRDI QIDQ2665976
Anton Dochtermann, Anna Truman, Evan Haithcock, Preston Cranford, Joshua Marsh, SuHo Oh
Publication date: 22 November 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.09138
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10) Combinatorial aspects of matroids and geometric lattices (05B35) Polynomials over commutative rings (13B25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pure \(O\)-sequences and matroid \(h\)-vectors
- Generalized permutohedra, \(h\)-vectors of cotransversal matroids and pure \(O\)-sequences
- A multicomplex of partially edge-rooted forests
- \(h\)-vectors of small matroid complexes
- On the structure of the \(h\)-vector of a paving matroid
- Pure \(\mathcal{O}\)-sequences arising from \(2\)-dimensional PS ear-decomposable simplicial complexes
- The homology of the cycle matroid of a coned graph
- Möbius coinvariants and bipartite edge-rooted forests
- Enumerative properties of Ferrers graphs
- Syzygies of oriented matroids
- On power ideals of transversal matroids and their ``parking functions
- The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
- Linear algebraic techniques for weighted spanning tree enumeration
- Lexicographic shellability, matroids, and pure order ideals
- Internally perfect matroids
- On the \(h\)-vector of a lattice path matroid
- Generic and special constructions of pure O -sequences
- Linear Algebraic Techniques for Spanning Tree Enumeration
- Active orders for matroid bases
