Combinatorial Derived Matroids

DOI10.37236/11327MaRDI QIDQ6402057arXivFDO

Authors Ragnar Freij-Hollanti, Relinde Jurrius, O. A. Kuznetsova

Publication date 14 June 2022

Published in arXiv

Full work available at URL https://doi.org/10.37236/11327

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)

arXiv classification

math.CO

Abstract: Let $M$ be an arbitrary matroid with circuits $mathcalC(M)$. We propose a definition of a derived matroid $deltaM$ that has as its ground set $mathcalC(M)$. Unlike previous attempts of such a definition, our definition applies to arbitrary matroids, and is completely combinatorial. We prove that the rank of $deltaM$ is bounded from above by $|M|-r(M)$, that it is connected if and only if $M$ is connected. We compute examples including the derived matroids of uniform matroids, the V'amos matroid and the graphical matroid $M(K_4)$. We formulate conjectures relating our construction to previous definitions of derived matroids.

This page was built for publication: Combinatorial Derived Matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402057)