The free product of matroids
From MaRDI portal
Publication:2567281
DOI10.1016/J.EJC.2004.05.005zbMATH Open1071.05024arXivmath/0409080OpenAlexW2093435500MaRDI QIDQ2567281FDOQ2567281
Publication date: 29 September 2005
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: We introduce a noncommutative binary operation on matroids, called free product. We show that this operation respects matroid duality, and has the property that, given only the cardinalities, an ordered pair of matroids may be recovered, up to isomorphism, from its free product. We use these results to give a short proof of Welsh's 1969 conjecture, which provides a progressive lower bound for the number of isomorphism classes of matroids on an n-element set.
Full work available at URL: https://arxiv.org/abs/math/0409080
Cites Work
Cited In (17)
- Connectivity gaps among matroids with the same enumerative invariants
- The free category with products on a multigraph
- A unique factorization theorem for matroids
- A matroid-friendly basis for the quasisymmetric functions
- A matroid operation that commutes with duality
- A quasisymmetric function for matroids
- Totally free expansions of matroids.
- A characterization of positroids, with applications to amalgams and excluded minors
- A free subalgebra of the algebra of matroids
- On the Hopf algebra of multi-complexes
- Signed permutohedra, delta‐matroids, and beyond
- The free product of M-fuzzifying matroids1
- Splicing matroids
- The \(\mathcal{G}\)-invariant and catenary data of a matroid
- Symmetric and quasi-symmetric functions associated to polymatroids
- Primitive elements in the matroid-minor Hopf algebra
- Semidirect sums of matroids
This page was built for publication: The free product of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567281)
