On the Finding of Final Polynomials

@article{Bokowski1990OnTF,
  title={On the Finding of Final Polynomials},
  author={J{\"u}rgen Bokowski and J{\"u}rgen Richter},
  journal={Eur. J. Comb.},
  year={1990},
  volume={11},
  pages={21-34}
}
Final polynomials have been used to prove non-representability for oriented matroids, i.e. to decide whether geometric embeddings of combinatorial structures exist. They received more attention when Dress and Sturmfels, independently, pointed out that non-representable oriented matroids always possess a final polynomial as a consequence of an appropriate real version of Hilbert's Nullstellensatz. We discuss the more difficult problem of determining such final polynomials algorithmically. We… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Chirotops and oriented matroids

A. Dress
Bayreuther Math. Schr., • 1986
View 6 Excerpts
Highly Influenced

An infinite family of minorminimal nonrealizable simplicial 3-chirotopes

J. Bokowski, B. Sturmfels
Math. Z., • 1989
View 4 Excerpts
Highly Influenced

Computational synthetic geometry, Lecture Notes in Mathematics, 1355 Berlin, Springer-Verlag

J. Bokowski, B. Sturmfels
Received • 1989

Computing final polynomials and final syzygies using Buchberger's Grobner bases method

B. Sturmfels
Results Math., • 1989

Computational synthetic geometry, Ph.D

B. Sturmfels
dissertation, University of Washington, Seattle, • 1987

Polytopal and non-polytopal spheres: an algorithmic approach, Israel

J. Bokowski, B. Sturmfels
J. Math., • 1987
View 3 Excerpts

Polytopal and nonpolytopal spheres : an algorithmic approach

B. Sturmfels
Israel J . Math . • 1987

A polynomial algorithm in linear programming , Sov

L. G. Khachian
Math . Dokl . • 1986

Similar Papers

Loading similar papers…