Journal article icon

Journal article

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 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.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Publisher copy:
10.1007/s10485-017-9490-2

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author


More from this funder
Funding agency for:
Patta, V
Grant:
EP/K503113/1


Publisher:
Springer Netherlands
Journal:
Applied Categorical Structures More from this journal
Volume:
26
Issue:
2
Pages:
205–237
Publication date:
2017-04-20
Acceptance date:
2017-03-29
DOI:
EISSN:
1572-9095
ISSN:
0927-2852


Language:
English
Keywords:
Pubs id:
pubs:690954
UUID:
uuid:d3e8696a-eafd-4673-97a3-689f787ca0e9
Local pid:
pubs:690954
Source identifiers:
690954
Deposit date:
2017-04-22

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP