Skip to main navigation Skip to search Skip to main content

Euclideaness and final polynomials in oriented matroid theory

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

This paper deals with a geometric construction of algebraic non-realizability proofs for certain oriented matroids. As main result we obtain an algorithm which generates a (bi-quadratic) final polynomial [3], [5] for any non-euclidean oriented matroid. Here we apply the results of Edmonds, Fukuda and Mandel [6], [7] concerning non-degenerate cycling of linear programs in non-euclidean oriented matroids.

Original languageEnglish
Pages (from-to)259-268
Number of pages10
JournalCombinatorica
Volume13
Issue number3
DOIs
StatePublished - Sep 1993

Keywords

  • AMS subject classification code (1991): 05B35, 51A25

Fingerprint

Dive into the research topics of 'Euclideaness and final polynomials in oriented matroid theory'. Together they form a unique fingerprint.

Cite this