Abstract
Oriented matroids are a combinatorial abstraction of finite sets of points in ℝn. They have been used to study various problems in discrete and computational geometry (for more material on oriented matroids, see [1,2]). A number of methods to generate oriented matroids have been proposed (for instance in [4,8-10]) as these methods can be used as a building block for the algorithmic treatment of some hard problems: Algorithms to generate oriented matroids have for instance been used to decide whether certain 4-polytopes exist [6,10,14]. For these questions it is important to have effective algorithms for the generation of oriented matroids. We propose to use satisfiability solvers to generate oriented matroids. We have adapted this approach to generate oriented matroids that satisfy certain geometric constraints. Even though one can use the generated oriented matroids as a first step to find realizations (see for instance [2,6]), we will only focus on non-realizability results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Björner, A., Vergnas, M.L., Sturmfels, B., White, N., Ziegler, G.: Oriented Matroids, 2nd edn. Encyclopedia of Mathematics and its Applications, vol. 46. Cambridge University Press, Cambridge (1999)
Bokowski, J.: Computational Oriented Matroids. Cambridge University Press, Cambridge (2006)
Bokowski, J., Grünbaum, B., Schewe, L.: Topological configurations(n4) exist for all n > 16 (submitted)
Bokowski, J., de Oliveira, A.G.: On the generation of orientedmatroids. Discrete Comput. Geom. 24(2-3), 197–208 (2000); The Branko Grünbaum birthday issue
Bokowski, J., Schewe, L.: There are no realizable 154- and 164-configurations. Rev. Roumaine Math. Pures Appl. 50(5–6), 483–493 (2005)
Bokowski, J., Sturmfels, B.: Computational Synthetic Geometry. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355. Springer, Heidelberg (1997)
The Coq development team, The Coq proof assistant reference manual, LogiCalProject, Version 8.0 (2004)
Finschi, L., Fukuda, K.: Generation of oriented matroids—a graph theoreticalapproach. 27(1), 117–136 (2002), Discrete Comput. Geom. Geometriccombinatorics (San Francisco, CA/Davis, CA, 2000)
Gugisch, R.: Konstruktion von Isomorphieklassen orientierter Matroide, Dissertation,Universität Bayreuth, German (2005)
Bremner, D.: MPC – Matroid Polytope Completion (June 2004), available at: http://www.cs.unb.ca/profs/bremner/mpc/
Eèn, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Gawrilow, E., Joswig, M.: Polymake: a Framework for AnalyzingConvex Polytopes. In: Kalai, G., Ziegler, G.M. (eds.) Polytopes — Combinatorics and Computation, pp. 43–74, Birkhäuser (2000)
Mahajan, Y.S., Fu, Z., Malik, S.: Zchaff2004: An efficient SATsolver. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 360–375. Springer, Heidelberg (2005)
Schuchert, P.: Matroidpolytope und Einbettungen kombinatorischer Mannigfaltigkeiten, Dissertation, TH Darmstadt (German) (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schewe, L. (2006). Generation of Oriented Matroids Using Satisfiability Solvers. In: Iglesias, A., Takayama, N. (eds) Mathematical Software - ICMS 2006. ICMS 2006. Lecture Notes in Computer Science, vol 4151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11832225_19
Download citation
DOI: https://doi.org/10.1007/11832225_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38084-9
Online ISBN: 978-3-540-38086-3
eBook Packages: Computer ScienceComputer Science (R0)