Thin sums matroids and duality

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.

24 pages

References in corpus (2)

• Axioms for infinite matroids
• Infinite matroids in graphs

Cited by in corpus (9)

• Infinite Matroids and Determinacy of Games
• An excluded minors method for infinite matroids
• Infinite graphic matroids Part I
• The ubiquity of Psi-matroids
• Matroids with an infinite circuit-cocircuit intersection
• Infinite trees of matroids
• Matroid and Tutte-connectivity in infinite graphs
• The structure of 2-separations of infinite matroids
• Nearly Finitary Matroids