Abstract
Matroids are combinatorial abstractions for point configurations and hyperplane arrangements, which are fundamental objects in discrete geometry. Matroids merely encode incidence information of geometric configurations such as collinearity or coplanarity, but they are still enough to describe many problems in discrete geometry, which are called incidence problems. We investigate two kinds of incidence problem, the points–lines–planes conjecture and the so-called Sylvester–Gallai type problems derived from the Sylvester–Gallai theorem, by developing a new algorithm for the enumeration of non-isomorphic matroids. We confirm the conjectures of Welsh–Seymour on ≤11 points in ℝ3 and that of Motzkin on ≤12 lines in ℝ2, extending previous results. With respect to matroids, this algorithm succeeds to enumerate a complete list of the isomorph-free rank 4 matroids on 10 elements. When geometric configurations corresponding to specific matroids are of interest in some incidence problems, they should be analyzed on oriented matroids. Using an encoding of oriented matroid axioms as a boolean satisfiability (SAT) problem, we also enumerate oriented matroids from the matroids of rank 3 on n≤12 elements and rank 4 on n≤9 elements. We further list several new minimal non-orientable matroids.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aichholzer, O., Aurenhammer, F., Krasser, H.: Enumerating order types for small point sets with applications. Order 19, 265–281 (2002)
Aichholzer, O., Krasser, H.: Abstract order type extension and new results on the rectilinear crossing number. Comput. Geom. 36, 2–15 (2006)
Betten, A., Betten, D.: Linear spaces with at most 12 points. J. Comb. Des. 7, 119–145 (1999)
Björner, A., Las Vergnas, M., Sturmfels, B., White, S.N., Ziegler, G.M. (eds.): Oriented Matroids, 2nd edn. Cambridge University Press, Cambridge (1999)
Blackburn, J.E., Crapo, H.H., Higgs, D.A.: A catalogue of combinatorial geometries. Math. Comput. 27, 155–166 (1973)
Bremner, D., Bokowski, J., Gévay, G.: Symmetric matroid polytopes and their generation. Eur. J. Comb., in press (2008). http://dx.doi.org/10.1016/j.ejc.2008.12.006
Brüngger, A., Marzetta, A., Fukuda, K., Nievergelt, J.: The parallel search bench ZRAM and its applications. Ann. Oper. Res. 90, 45–63 (1999)
Crapo, H.H.: Single-element extensions of matroids. J. Res. Natl. Bur. Stand. 69B, 55–65 (1965)
Crowe, D.W., McKee, T.A.: Sylvester’s problem on collinear points. Math. Mag. 41, 30–34 (1968)
Csima, J., Sawyer, E.T.: There exist 6n/13 ordinary points. Discrete Comput. Geom. 9, 187–202 (1993)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5(7), 394–397 (1962)
Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201–215 (1960)
Dirac, G.A.: Collinearity properties of sets of points. Q. J. Math. 2, 221–227 (1951)
Eén, N., Sörensson, N.: Minisat page. http://minisat.se/
Erdös, P.: Problems for solution, # 4065. Am. Math. Mon. 50, 65 (1943)
Erdös, P.: Solution of problem 4065. Am. Math. Mon. 51, 169–171 (1944)
Faradzev, I.A.: Generation of nonisomorphic graphs with a given degree sequence. In: Algorithmic Studies in Combinatorics, pp. 11–19. Nauka, Moscow (1978) (Russian)
Finschi, L.: A graph theoretical approach for reconstruction and generation of oriented matroids. PhD thesis, Swiss Federal Institute of Technology Zurich (2001)
Finschi, L., Fukuda, K.: Homepage of oriented matroids. http://www.om.math.ethz.ch/
Finschi, L., Fukuda, K.: Generation of oriented matroids—a graph theoretical approach. Discrete Comput. Geom. 27, 117–136 (2002)
Finschi, L., Fukuda, K.: Complete combinatorial generation of small point configurations and hyperplane arrangements. In: Aronov, B., Pach, J. (eds.) The Goodman-Pollack Festschrift, pp. 425–440. Springer, Berlin (2003)
Folkman, J., Lawrence, J.: Oriented matroids. J. Comb. Theory, Ser. B 25, 199–236 (1978)
Goodman, J.E., O’Rourke, J.: Handbook of Discrete and Computational Geometry. CRC Press Series on Discrete Mathematics and Its Applications, 2nd edn. CRC Press, Boca Raton (2004)
Grünbaum, B.: The importance of being straight. In: In Proc. 12th Biannual Intern. Seminar of the Canadian Math. Congress, pp. 243–254. Vancouver, 1969 (1970)
Gugisch, R.: A construction of isomorphism classes of oriented matroids. In: Klin, M., Jones, G.A., Jurisic, A., Muzychuk, M., Ponomarenko, I. (eds.) Algorithmic Algebraic Combinatorics and Gröbner Bases, pp. 229–249. Springer, Berlin (2009)
Hansen, S.: A generalization of a theorem of Sylvester to the lines determined by a finite point set. Math. Scand. 16, 175–180 (1965)
Hansen, S.: Contributions to the Sylvester–Gallai theory. PhD thesis, University of Copenhagen (1981)
Mayhew, D., Royle, G.F.: Matroids with nine elements. J. Comb. Theory, Ser. B 98, 415–431 (2008)
McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26, 306–324 (1998)
Melchior, E.: Uber vielseite der projektiven ebene. Deutsche Math. 5, 13 (1940)
Motzkin, T.: The lines and planes connecting the points of a finite set. Trans. Am. Math. Soc. 70, 451–464 (1951)
Motzkin, Th.: The lines and planes connecting the points of a finite set. Trans. Am. Math. Soc. 70, 451–464 (1951)
Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)
Read, R.C.: Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations. Ann. Discrete Math. 2, 107–120 (1978)
Richter-Gebert, J.: Testing orientability for matroids is NP-complete. Adv. Appl. Math. 23(1), 78–90 (1999)
Royle, G., Mayhew, D.: Small matroids. http://people.csse.uwa.edu.au/gordon/small-matroids.html
Schewe, L.: Satisfiability problems in discrete geometry. Dissertation, TU Darmstadt (2007)
Seymour, P.D.: On the points–lines–planes conjecture. J. Comb. Theory, Ser. B 33, 17–26 (1982)
Sylvester, J.J.: Mathematical question 11851. Educ. Times 45, 231 (1893)
Welsh, D.J.A.: Matroid Theory. Academic Press, New York (1976)
Ziegler, G.M.: Some minimal non-orientable matroids of rank three. Geom. Dedic. 38, 365–371 (1991)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Matsumoto, Y., Moriyama, S., Imai, H. et al. Matroid Enumeration for Incidence Geometry. Discrete Comput Geom 47, 17–43 (2012). https://doi.org/10.1007/s00454-011-9388-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-011-9388-y