arXiv · 1512.01390
The category of matroids
Abstract
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; 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Chris Heunen, Vaia Patta. 2018-09-23. The category of matroids. https://doi.org/10.1007/s10485-017-9490-2
Cite the original work for its findings. Save a collection to share your selection of sources.