The free product of matroids
From MaRDI portal
Publication:2567281
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.
Recommendations
Cites work
Cited in
(21)- Primitive elements in the matroid-minor Hopf algebra
- A quasisymmetric function for matroids
- The free category with products on a multigraph
- Totally free expansions of matroids.
- A matroid operation that commutes with duality
- On the Hopf algebra of multi-complexes
- Splicing matroids
- Semidirect sums of matroids
- A free subalgebra of the algebra of matroids
- A unique factorization theorem for matroids
- The free product of M-fuzzifying matroids
- Connectivity gaps among matroids with the same enumerative invariants
- Signed permutohedra, delta‐matroids, and beyond
- A characterization of positroids, with applications to amalgams and excluded minors
- The \(\mathcal{G}\)-invariant and catenary data of a matroid
- The free product of q-matroids
- Hopf monoids of ordered simplicial complexes
- On the number of non-isomorphic matroids
- Symmetric and quasi-symmetric functions associated to polymatroids
- A matroid-friendly basis for the quasisymmetric functions
- A note on totally free 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)