Can I read Infinite Matroids and Determinacy of Games on EtoBox?

Infinite Matroids and Determinacy of Games by Bowler, Nathan; Carmesin, Johannes is a scholarly article available to read on EtoBox.

What is Infinite Matroids and Determinacy of Games about?

Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be used to provide counterexamples against the natural extension of the Well-quasi-ordering-Conjecture to infinite matroids and to show that the class of planar infinite matroids does not have a universal matroid. The existence of these matroids has a connection to Set Theory in that it corresponds to the Determinacy of certain games. To show that our construction gives matroids, we introduce a new very simple axiomatization of the class of countable tame matroids.

Author

Bowler, Nathan; Carmesin, Johannes

Published

2013

Language

EN