Thin sums matroids and duality
Combinatorics
2012-04-30 v1
Abstract
Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families are precisely the duals of representable matroids (those arising from vector spaces). We also show that the class of tame thin sums matroids is closed under duality and under taking minors, by giving a new characterisation of the matroids in this class. Finally, we show that all the matroids naturally associated to an infinite graph are tame thin sums matroids.
Cite
@article{arxiv.1204.6294,
title = {Thin sums matroids and duality},
author = {Hadi Afzali and Nathan Bowler},
journal= {arXiv preprint arXiv:1204.6294},
year = {2012}
}
Comments
24 pages