Quasi-matroidal classes of ordered simplicial complexes
DOI10.1016/J.JCTA.2020.105274zbMATH Open1442.05257arXiv1608.04025OpenAlexW3032496482MaRDI QIDQ778707FDOQ778707
Authors: José Alejandro Samper
Publication date: 3 July 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.04025
Recommendations
Graph polynomials (05C31) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- A Contribution to the Theory of Chromatic Polynomials
- Combinatorics and commutative algebra.
- The Tutte polynomial
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial Laplacians of matroid complexes
- What can be said about pure O-sequences?
- On the \(h\)-vector of a lattice path matroid
- Zonotopal algebra and forward exchange matroids
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- Generalized permutohedra, \(h\)-vectors of cotransversal matroids and pure \(O\)-sequences
- Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes
- On the structure of the \(h\)-vector of a paving matroid
- Title not available (Why is that?)
- Weakly Polymatroidal Ideals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weakly polymatroidal ideals with applications to vertex cover ideals
- The number of faces of a simplicial convex polytope
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Log-concavity of characteristic polynomials and the Bergman fan of matroids
- Lexicographic shellability, matroids, and pure order ideals
- Matroids with nine elements
- The Broken-Circuit Complex
- \(h\)-vectors of small matroid complexes
- Title not available (Why is that?)
- Optimal assignments in an ordered set: An application of matroid theory
- Hodge theory for combinatorial geometries
- \(g\)-elements of matroid complexes.
- Pure \(O\)-sequences and matroid \(h\)-vectors
- Combinatorial geometries, convex polyhedra, and Schubert cells
- Shifted simplicial complexes are Laplacian integral
- Recurrence relations for the spectrum polynomial of a matroid
- Harmonic functions and boundary value problems on a chain complex
- \( h\)-vectors of matroids and logarithmic concavity
- Generic and special constructions of pure \(O\)-sequences
- Computing Betti numbers via combinatorial Laplacians
- The combinatorial Laplacian of the Tutte complex
- Internally perfect matroids
- A common recursion for Laplacians of matroids and shifted simplicial complexes
- Algebraic and geometric methods in enumerative combinatorics
- Flawlessness of \(h\)-vectors of broken circuit complexes
Cited In (9)
- The templates for some classes of quaternary matroids
- Linear extensions and shelling orders
- Relaxations of the matroid axioms. I: Independence, exchange and circuits
- Title not available (Why is that?)
- Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
- Finiteness theorems for matroid complexes with prescribed topology
- Simplicial complexes obtained from qualitative probability orders
- The \(h\)-vector of a positroid is a pure O-sequence
- Convexity in ordered matroids and the generalized external order
This page was built for publication: Quasi-matroidal classes of ordered simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778707)