On the Possibilities of Defining Infinite Oriented Matroids
Combinatorics
2026-03-18 v1
Abstract
Is it possible to define cryptomorphic axiom systems for infinite oriented matroids by lifting some of the axiom systems for finite oriented matroids to the infinite setting while not losing duality in the process? We show that the answer to this question is a twofold "no". First, lifting the circuit axioms neither preserves duality nor inheritance of strong circuit elimination in minors. Second, although duality is kept intact by translating the orthogonality axioms and an axiom system based on the Farkas Lemma, the classes of infinite oriented matroids obtained in this way have the property that one is a proper subclass of the other.
Cite
@article{arxiv.2603.15843,
title = {On the Possibilities of Defining Infinite Oriented Matroids},
author = {Nathan Bowler and Winfried Hochstättler and Stefan Kaspar},
journal= {arXiv preprint arXiv:2603.15843},
year = {2026}
}
Comments
43 pages, 8 figures