The Category of Matroids

Open Access


The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful and having a nearly full Kan extension; there is a functor to the category of geometric lattices, that is nearly full; there are various adjunctions and free constructions on subcategories, inducing a simplification monad; there are two orthogonal factorization systems; some, but not many, combinatorial constructions from matroid theory are functorial. Finally, a characterization of matroids in terms of optimality of the greedy algorithm can be rephrased in terms of limits.


  1. 1.
    Abramsky, S.: Abstract scalars, loops, and free traced and strongly compact closed categories Algebra and Coalgebra in Computer Science, pp. 1–29. Springer (2005)Google Scholar
  2. 2.
    Adámek, J., Herrlich, H., Strecker, G.E.: Abstract and concrete categories. John Wiley (1990)Google Scholar
  3. 3.
    Al-Hawary, T.A.: Toward an elementary axiomatic theory of the category of loopless pointed matroids and pointed strong maps. Ph.D. thesis, University of Montana (1997)Google Scholar
  4. 4.
    Al-Hawary, T.A.: Free objects in the category of geometries. Int. J. Math. Math. Sci. 26(12), 765–770 (2000)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Al-Hawary, T.A., McRae, D.G.: Toward an elementary axiomatic theory of the category of LP-matroids. Appl. Categ. Struct. 11, 157–169 (2003)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Anderson, L.: Matroid bundles. New perspectives in algebraic combinatorics, 1–21 (1999)Google Scholar
  7. 7.
    Brown, R., Morris, I., Shrimpton, J., Wensley, C.D.: Graphs of morphisms of graphs. Electron. J. Comb. 15(A1), 1 (2008)MathSciNetMATHGoogle Scholar
  8. 8.
    Bruhn, H., Diestel, R., Kriesell, M., Pendavingh, R., Wollan, P.: Axioms for infinite matroids. Adv. Math. 239(1), 18–46 (2013)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Brylawski, T.H.: A combinatorial model for series-parallel networks. Trans. Am. Math. Soc. 154, 1–22 (1971)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Crapo, H.: Constructions in combinatorial geometries. In: NSF Advanced Science Seminar in Combinatorial Theory)(Notes, Bowdoin College) (1971)Google Scholar
  11. 11.
    Heunen, C.: Semimodule enrichment. In: Mathematical Foundations of Programming Semantics XXIV, no. 218 in Electronic Notes in Theoretical Computer Science, pp. 193–208 (2008)Google Scholar
  12. 12.
    Higgs, D.: Strong maps of geometries. J. Combinatorial Theory 5(2), 185–191 (1968)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Kahn, J., Kung, J.P.: Varieties of combinatorial geometries. Trans. Am. Math. Soc. 271(2), 485–499 (1982)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Kennedy, D.: Majors of geometric strong maps. Discret. Math. 12(4), 309–340 (1975)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Kung, J.P.S.: Bimatroids and invariants. Adv. Math. 30(3), 238–249 (1978)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Kung, J.P.S.: Twelve views of matroid theory. Combinatorial and Computational Mathematics: Present and Future (2001)Google Scholar
  17. 17.
    Lu, L., Zheng, W.: Categorical relations among matroids, fuzzy matroids and fuzzifying matroids. Iranian J. Fuzzy Syst. 7(1), 81–89 (2010)MathSciNetMATHGoogle Scholar
  18. 18.
    Mac Lane, S.: Some interpretations of abstract linear independence in terms of projective geometry. Am. J. Math. 58(1), 236–240 (1936)CrossRefGoogle Scholar
  19. 19.
    Mac Lane, S.: Categories for the working mathematician, 2nd edn. Springer (1971)Google Scholar
  20. 20.
    Neel, D.L., Neudauer, N.A.: Matroids you have known. Math. Mag. 82(1), 26–41 (2009)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Oxley, J.: Matroid theory, 2nd edn. Oxford University Press, Oxford (2011)CrossRefMATHGoogle Scholar
  22. 22.
    Pultr, A., Tholen, W.: Free Quillen factorization systems. Georgian Math. J. 9(2), 807–820 (2002)MathSciNetMATHGoogle Scholar
  23. 23.
    Recski, A.: Elementary strong maps of graphic matroids. Graphs and Combinatorics 3(1), 379–382 (1987)MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    Stamps, M.T.: Topological representations of matroid maps. J. Algebr. Combinatorics 37(2), 265–287 (2013)MathSciNetCrossRefMATHGoogle Scholar
  25. 25.
    White, N.: Theory of matroids. Cambridge University Press, Cambridge (1986)CrossRefMATHGoogle Scholar
  26. 26.
    Whitney, H.: On the abstract properties of linear independence. Am. J. Math. 57(3), 509–533 (1935)CrossRefMATHGoogle Scholar
  27. 27.
    Zangurashvili, D.: Several constructions for factorization systems. Theory and Appl. Categories 12(11), 326–354 (2004)MathSciNetMATHGoogle Scholar
  28. 28.
    Zaslavsky, T.: Biased graphs II. The three matroids. J. Combinatorial Theory B 51(1), 46–72 (1991)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© The Author(s) 2017

Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Authors and Affiliations

  1. 1.University of EdinburghEdinburghUK
  2. 2.University of OxfordOxfordUK

Personalised recommendations