Abstract
Richter-Gebert proved that every non-Euclidean uniform oriented matroid admits a biquadratic final polynomial. We extend this result to the non-uniform case.
Similar content being viewed by others
References
R. G. Bland: A combinatorial abstraction of linear programming, J. Combinatorial Theory B23 (1977), 33–57.
A. Björner, M. Las Vergnas, B. Sturmfels, N. White and G. M. Ziegler: Oriented Matroids, Second Edition, Encyclopedia of Mathematics, Cambridge University Press (1993), 46.
K. Fukuda: Oriented Matroid Programming, Doctoral Thesis, University of Waterloo (1982), 223 pages.
H. Nakayama, S. Moriyama, K. Fukuda and Y. Okamoto: Comparing the strength of the non-realizability certificates for oriented matroids, in: Proc. of 4th Japanese-Hungarian Symp. on Discrete Mathematics and Its Appl., (2005), 243–249.
J. Richter-Gebert: On the Realizability Problem of Combinatorial Geometries — Decision Methods, Doctoral Thesis, TU-Darmstadt (1992), 144 pages.
J. Richter-Gebert: Euclideaness and final polynomials in oriented matroid theory, Combinatorica13(3) (1993), 259–268.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by the Swiss National Science Foundation Project 200021-105202, “Polytopes, Matroids and Polynomial Systems”.
Rights and permissions
About this article
Cite this article
Fukuda, K., Moriyama, S., Nakayama, H. et al. Every non-Euclidean oriented matroid admits a biquadratic final polynomial. Combinatorica 29, 691–698 (2009). https://doi.org/10.1007/s00493-009-2255-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-009-2255-2