Lattice path matroids: Enumerative aspects and Tutte polynomials
From MaRDI portal
Publication:1417949
DOI10.1016/S0097-3165(03)00122-5zbMath1031.05031arXivmath/0211188OpenAlexW1978284489MaRDI QIDQ1417949
Anna de Mier, Marc Noy, Joseph E. Bonin
Publication date: 6 January 2004
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0211188
Catalan numberTutte polynomial\(\beta\) invariantBroken circuit complexLattice pathTransversal matroid
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (48)
Upper bounds of Schubert polynomials ⋮ The excluded minors for lattice path polymatroids ⋮ Standard complexes of matroids and lattice paths ⋮ Bergman Complexes of Lattice Path Matroids ⋮ Lattice path matroids: the excluded minors ⋮ On the Ehrhart polynomial of minimal matroids ⋮ Ehrhart theory of paving and panhandle matroids ⋮ Generalized laminar matroids ⋮ Symmetries of statistics on lattice paths between two boundaries ⋮ Connectivity gaps among matroids with the same enumerative invariants ⋮ On the Ehrhart polynomial of Schubert matroids ⋮ Some inequalities for the Tutte polynomial ⋮ Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a cyclic lemma ⋮ Tree automata and pigeonhole classes of matroids. II ⋮ The Natural Matroid of an Integer Polymatroid ⋮ The excluded minors for the intersection of bicircular and lattice path matroids ⋮ Schubert matroids, Delannoy paths, and Speyer's invariant ⋮ Ideal hierarchical secret sharing and lattice path matroids ⋮ Positroids and Schubert matroids ⋮ Toric ideals of lattice path matroids and polymatroids ⋮ The Tutte polynomial of some matroids ⋮ The Catalan matroid ⋮ Generalized counting constraint satisfaction problems with determinantal circuits ⋮ Computing the Tutte polynomial of lattice path matroids using determinantal circuits ⋮ On the generality of the greedy algorithm for solving matroid base problems ⋮ Counting Hamiltonian cycles in the matroid basis graph ⋮ A Tutte polynomial inequality for lattice path matroids ⋮ On lattice path matroid polytopes: integer points and Ehrhart polynomial ⋮ Laminar matroids ⋮ Vertices of Schubitopes ⋮ Matroid base polytope decomposition ⋮ Lattice path matroids: structural properties ⋮ Proof of a lattice paths conjecture connected to the tennis ball problem ⋮ Unnamed Item ⋮ A little statistical mechanics for the graph theorist ⋮ Delta-matroids as subsystems of sequences of Higgs lifts ⋮ Splicing matroids ⋮ Facial structures of lattice path matroid polytopes ⋮ Roadblocked monotonic paths and the enumeration of coalescent histories for non-matching caterpillar gene trees and species trees ⋮ Simple formulas for lattice paths avoiding certain periodic staircase boundaries ⋮ P-flag spaces and incidence stratifications ⋮ The number of lattice paths below a cyclically shifting boundary ⋮ The family of bicircular matroids closed under duality ⋮ A free subalgebra of the algebra of matroids ⋮ A note on some inequalities for the Tutte polynomial of a matroid ⋮ A unique factorization theorem for matroids ⋮ A solution to the tennis ball problem ⋮ The Dehn–Sommerville relations and the Catalan matroid
Uses Software
Cites Work
- The tennis ball problem
- Algebraic languages and polyominoes enumeration
- The complexity of computing the Tutte polynomial on transversal matroids
- Lattice path matroids: structural properties
- The Tutte Polynomial Part I: General Theory
- An Affine Representation for Transversal Geometries
- A bound for the number of matroids
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lattice path matroids: Enumerative aspects and Tutte polynomials
