Abstract
This paper deals with a class of computational problems in real algebraic geometry. We introduce the concept of final polynomials as a systematic approach to prove nonrealizability for oriented matroids and combinatorial geometries.
Hilbert's Nullstellensatz and its real analogue imply that an abstract geometric object is either realizable or it admits a final polynomial. This duality has first been applied by Bokowski in the study of convex polytopes [7] and [11], but in these papers the resulting final polynomials were given without their derivations.
It is the objective of the present paper to fill that gap and to describe an algorithm for constructing final polynomials for a large class of nonrealizable chirotopes. We resolve a problem posed in [10] by proving that not every realizable simplicial chirotope admits a solvability sequence. This result shows that there is no easy combinatorial method for proving nonrealizability and thus justifies our final polynomial approach.
Article PDF
Similar content being viewed by others
References
Altshuler, A.; Bokowski, J.; Steinberg, L.: The classification of simplicial 3-spheres with nine vertices into polytopes and non-polytopes,Discrete Math. 31 (1980), 115–124.
Antonin, C.: Ein Algorithmusansatz für Realisierungsfragen imE d getestet an kombinatorischen 3-Sphären. Staatsexamensarbeit, Bochum, 1982.
Bachem, A.: Convexity and optimization in discrete structures. InConvexity and Applications (ed. P. M. Gruber and J. Wills), Birkhäuser, Basel, 1983.
Bland, R.; Las Vergnas, M.: Orientability of matroids,J. Combin. Theory Ser. B 24 (1978), 94–123.
Bokowski, J.; Brehm, U.:A New Polyhedron of Genus 3 with 10 Vertices. Colloquia Mathematica Societatis János Bolyai, Siofok, 1985.
Bokowski, J.; Eggert, A.: All realizations of Möbius' torus with seven vertices. Preprint No. 1009, Technische Hochschule Darmstadt, 1987.
Bokowski, J.; Garms, K.: Altshuler's sphereM 10425 is not polytopal,European J. Combin. 8 (1987), 227–229.
Bokowski, J.; Richter, J.: On the finding of final polynomials, Manuscript, 1988.
Bokowski, J.; Shemer, I.: Neighborly 6-polytopes with 10 vertices,Israel J. Math. 58 (1987), 103–124.
Bokowski, J.; Sturmfels, B.: On the coordinatization of oriented matroids,Discrete Comput. Geom. 1 (1986), 293–306.
Bokowski, J.; Sturmfels, B.: Polytopal and non-polytopal spheres—an algorithmic approach,Israel J. Math. 57 (1987), 121–124.
Bokowski, J.; Sturmfels, B.: An infinite family of minorminimal nonrealizable simplicial 3-chirotopes, submitted for publication.
Canny, J. F.: Robot motion planning and real geometry.Proc. 28th Annual IEEE Conference of Foundations of Computer Science, Los Angeles, 1987.
Collins, C.:Quantifier Elimination for Real Closed Fields by Cyclindrical Algebraic Decomposition (Proc. 2nd GI Conf. on Automata and Formal Languages). Lecture Notes in Computer Science, Vol. 33, Springer-Verlag, Berlin, 1975, pp. 134–163.
Dress, A.: Chirotops and oriented matroids,Bayreuth. Math. Schr. 21 (1986), 14–68.
Gelfand, I. M.; Goresky, R. M.; MacPherson, R. D.; Serganova, V.: Combinatorial geometries, convex polyhedra and Schubert cells,Adv. in Math. 63 (1987), 301–316.
Grigoryev, D. Y.; Vorobjov, N. N.: Solving systems of polynomial inequalities in subexponential time,J. Symbolic Comput., to appear.
Jaggi, B.; Mani-Levitska, P.: A simple arrangement of lines without the isotopy property. Manuscript, University Bern, 1988.
Lawrence, J.: Oriented matroids and multiple ordered sets,Linear Algebra Appl. 48 (1982), 1–12.
Ljubić, D.; Roudneff, J.-P.; Sturmfels, B.: Arrangements of lines and pseudolines without adjacent triangles,J. Combin. Theory Ser. A, to appear.
Mandel, A.: Topology of oriented matroids. Ph.D. Thesis, University of Waterloo, Ontario, 1981.
Richter, J.; Sturmfels, B.: On the geometric construction of oriented matroids and convex polytopes, submitted for publication.
Roudneff, J.-P.: On the number of triangles in simple arrangements of pseudolines in the real projective plane,Discrete Math. 60 (1986), 243–251.
Roudneff, J.-P.; Sturmfels, B.: Simplicial cells in arrangements and mutations of oriented matroids,Geom. Dedicata 27 (1988), 153–170.
Sturmfels, B.: Boundary complexes of convex polytopes cannot be characterized locally,J. London Math. Soc. 35 (1987), 314–326.
Sturmfels, B.: On the decidability of diophantine problems in combinatorial geometry,Bull. Amer. Math. Soc. 17 (1987), 121–124.
Sturmfels, B.:Computational Synthetic Geometry. Lecture Notes in Mathematics, Vol. 1355, Springer-Verlag, Heidelberg, 1988.
Sturmfels, B.: Computational algebraic geometry of projective configurations. InSymbolic Computations in Geometry, IMA Preprint Series No. 389, University of Minnesota, 1988.
White, N.: The bracket ring of a combinatorial geometry, I,Trans. Amer. Math. Soc. 202 (1975), 79–103.
White, N. (ed.):Theory of Matroids, Cambridge University Press, Cambridge, 1986.
White, N.: A nonuniform matroid which violates the isotopy conjecture,Discrete Comput. Geom. 4 (1989), 1–2.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bokowski, J., Richter, J. & Sturmfels, B. Nonrealizability proofs in computational geometry. Discrete Comput Geom 5, 333–350 (1990). https://doi.org/10.1007/BF02187794
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187794