Characterization of single-element extensions preserving Euclideanness

Characterize which kinds of single-element extensions of oriented matroids preserve the Euclidean property of an oriented matroid program.

Background

Euclidean oriented matroid programs are defined by the absence of directed cycles in their directed cocircuit graphs. Although Euclideanness is known to be preserved under taking minors and parallel extensions, its behavior under general single-element extensions was not understood. The paper addresses an important subclass by proving that lexicographic extensions preserve Euclideanness, but the broader classification of extensions that preserve this property remains unresolved.

References

Euclideanness of oriented matroid programs is far from well understood. While it is clear that a minor of a Euclidean oriented matroid program is still Euclidean, see , 9.III.17 or , 10.5.6, it is an open question which kind of single-element extensions of oriented matroids preserve Euclideanness.

Lexicographic Extensions preserve Euclideaness  (2501.17287 - Hochstättler et al., 22 Jan 2025) in Section 1, Introduction