Abstract
This paper defines a “connected sum” operation on oriented matroids of the same rank. This construction is used for three different applications in rank 4. First it provides nonrealizable pseudoplane arrangements with a low number of simplicial regions. This contrasts the case of realizable hyperplane arrangements: by a classical theorem of Shannon every arrangement ofn projective planes in ℝPd-1 contains at leastn simplicial regions and every plane is adjacent to at leastd simplicial regions [17], [18]. We construct a class of uniform pseudoarrangements of 4n pseudoplanes in ℝP3 with only 3n+1 simplicial regions. Furthermore, we construct an arrangement of 20 pseudoplanes where one plane is not adjacent to any simplicial region.
Finally we disprove the “strong-map conjecture” of Las Vergnas [1]. We describe an arrangement of 12 pseudoplanes containing two points that cannot be simultaneously contained in an extending hyperplane.
Article PDF
Similar content being viewed by others
References
L. Allys and M. Las Vergnas: Minors of matroid morphisms.J. Combin. Theory Ser. B, to appear.
L. J. Billera, M. M. Kapranov, and B. Sturmfels: On a conjecture of Baues in the theory of loop spaces. Preprint, Cornell University, 1991.
A. Björner, M. Las Vergnas, B. Sturmfels, N. White, and G. M. Ziegler:Oriented Matroids. Cambridge University Press, Cambridge, 1991.
R. G. Bland: A combinatorial abstraction of linear programming.J. Combin. Theory Ser. B 23 (1977), 33–57.
R. G. Bland and M. Las Vergnas: Orientability of matroids.J. Combin. Theory Ser. B 24 (1978), 94–123.
J. Bokowski and J. Richter-Gebert: On the classification of non-realizable oriented matroids, Part II: properties. Preprint, TH-Darmstadt, 1990.
J. Bokowski and B. Sturmfels,Computational Synthetic Geometry. Lecture Notes in Mathematics, Vol. 1355. Springer-Verlag, Berlin, 1989.
J. Fokkman and J. Lawrence: Oriented matroids,J. Combin. Theory Ser. B 25 (1978), 199–238.
K. Fukuda: Oriented Matroid Programming. Ph.D. Thesis, University of Waterloo, 1982.
J. E. Goodman and R. Pollack: Three points do not determine a (pseudo-) plane.J. Combin. Theory Ser. A 31 (1981), 215–218.
M. Las Vergnas: Extensions ponctuelles d'une géométrie combinatorie orientée. In:Problémes combinatoires et théorie des graphes (Actes Coll., Orsay, 1976), Colloques internationaux, No. 260, C.N.R.S., 1978, pp. 265–270.
M. Las Vergnas: Convexity in oriented matroids.J. Combin. Theory Ser. B 29 (1980), 231–243.
A. Mandel: Topology of Oriented Matroids. Ph.D. Thesis, University of Waterloo, 1982.
M. E. Mnëv and J. Richter-Gebert: Two constructions of oriented matroids with disconnected extension space.Discrete Comput. Geom., this issue, pp. 271–285.
M. E. Mnëv and G. M. Ziegler: Combinatorial models for the finite-dimensional Grassmannians.Discrete Comput. Geom., this issue, pp. 241–250.
J. P. Roudneff and B. Sturmfels: Simplicial cells in arrangements and mutations of oriented matroids.Geom. Dedicata 27 (1988), 153–170.
R. W. Shannon: A lower bound on the number of cells in arrangements of hyperplanes.J. Combin. Theory Ser. A 20 (1976), 327–335.
R. W. Shannon: Simplicial cells in arrangements of hyperplanes.Geom. Dedicata 8 (1979), 179–187.
B. Sturmfels and G. Ziegler: Extension spaces of oriented matroids.Discrete Comput. Geom. 10(1) (1993), 23–45.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Richter-Gebert, J. Oriented matroids with few mutations. Discrete Comput Geom 10, 251–269 (1993). https://doi.org/10.1007/BF02573980
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02573980