Kuratowski's and Wagner's theorems for matroids

In an earlier paper we proved the following theorem, which provides a strengthening of Tutte's well-known characterization of regular (totally unimodular) matroids: A binary matroid is regular if it does not have the Fano matroid or its dual as a series-minor (parallel-minor). In this paper we prove two theorems (Theorems 5.1 and 6.1) which provide the same kind of strengthening for Tutte's characterization of the graphic matroids (i.e., bond-matroids). One interesting aspect of these theorems is the introduction of the matroids of “type R”. It turns out that these matroids are, in at least two different senses, the smallest regular matroids which are neither graphic nor cographic (Theorems 6.2 and 6.3).     

A strengthened form of Tutte's characterization of regular matroids

We prove the following theorem: A binary matroid is regular (totally unimodular) if and only if it has no submatroid that is a series extension of a Fano matroid or its dual. This theorem may be viewed as strengthening Tutte's celebrated characterization of regular matroids in the spirit of Kuratowski's theorem on planar graphs.     

On the regularity of orientable matroids

We present two characterizations of regular matroids among orientable matroids and use them to give a measure of “how far” an orientable matroid is from being regular.     

Convexity in oriented matroids

We generalize to oriented matroids classical notions of Convexity Theory: faces of convex polytopes, convex hull, etc., and prove some basic properties. We relate the number of acyclic orientations of an orientable matroid to an evaluation of its Tutte polynomial.     

Systems of Polynomials for Detecting Orientable Matroids

We study systems of polynomial equations that correspond to a matroid M. Each of these systems has a zero solution if and only if M is orientable. Since determining if a matroid is orientable is NP-complete with respect to the size of the input data, determining if these systems have solutions is also NP-complete. However, we show that one of the associated polynomial systems corresponding to M is linear if M is a binary matroid and thus it may be determined if binary matroids are orientable in polynomial time given the circuits and cocircuits of said matroid as the input. In the case when M is not binary, we consider the associated system of non-linear polynomials. In this case Hilbertʼs Nullstellensatz gives us that M is non-orientable if and only if a certain certificate to the given polynomials system exists. We wish to place bounds on the degree of these certificates in future research.     

Topological representations of matroid maps

The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid arises from the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we use a construction of Engström to show that structure-preserving maps between matroids induce topological mappings between their representations; a result previously known only in the oriented case. Specifically, we show that weak maps induce continuous maps and that this process is a functor from the category of matroids with weak maps to the homotopy category of topological spaces. We also give a new and conceptual proof of a result regarding the Whitney numbers of the first kind of a matroid.     

Orientable arithmetic matroids

The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of “oriented arithmetic matroid” and prove some properties like the “uniqueness of orientation”.     

Cubes and orientability

We define and study a new class of matroids: cubic matroids. Cubic matroids include, as a particular case, all affine cubes over an arbitrary field. There is only one known orientable cubic matroid: the real affine cube. The main results establish as an invariant of orientable cubic matroids the structure of the subset of acyclic orientations with LV-face lattice isomorphic to the face lattice of the real cube or, equivalently, with the same signed circuits of length 4 as the real cube.     

Skew partial fields,multilinear representations of matroids,and a matrix tree theorem

We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte?s definition, using chain groups. We show how such representations behave under duality and minors, we extend Tutte?s representability criterion to this new class, and we study the generator matrices of the chain groups. An example shows that the class of matroids representable over a skew partial field properly contains the class of matroids representable over a skew field. Next, we show that every multilinear representation of a matroid can be seen as a representation over a skew partial field. Finally we study a class of matroids called quaternionic unimodular. We prove a generalization of the matrix tree theorem for this class.     

The incidence structure of subspaces with well-scaled frames

In this paper, the incidence structure of classes of subspaces that generalize the regular (unimodular) subspaces of rational coordinate spaces is studied. Let F the a field and S - F β {0}. A subspace, V, of a coordinate space over F is S-regular if every elementary vector of V can be scaled by an element of F β {0} so that all of its non-zero entries are elements of S. A subspace that is {−1, +1 }-regular over the rational field is regular.Associated with a subspace, V, over an arbitrary (respectively, ordered) field is a matroid (oriented matroid) having as circuits (signed circuits) the set of supports (signed supports) of elementary vectors of V. Fundamental representation properties are established for the matroids that arise from certain classes of subspaces. Matroids that are (minor) minimally non-representable by various classes of subspaces are identified. A unique representability results is established for the oriented matroids of subspaces that are dyadic (i.e., {±2⁰, ±2¹, ±2², …}-regular) over the rationals. A self-dual characterization is established for the matroids of S-regular subspaces which generalizes Minty's characterization of regular spaces as digraphoids.     

Two constructions of oriented matroids with disconnected extension space

The extension space ℰ(ℳ) of an oriented matroid ℳ is the poset of all one-element extensions of ℳ, considered as a simplicial complex. We present two different constructions leading to rank 4 oriented matroids with disconnected extension space. We prove especially that if an elementf is not contained in any mutation of a rank 4 oriented matroid ℳ, then ℰ(ℳ\f) contains an isolated point. A uniform nonrealizable arrangement of pseudoplanes with this property is presented. The examples described contrast results of Sturmfels and Ziegler [12] who proved that for rank 3 oriented matroids the extension space has the homotopy type of the 2-sphere.     

Quasi‐graphic matroids*

Frame matroids and lifted‐graphic matroids are two interesting generalizations of graphic matroids. Here, we introduce a new generalization, quasi‐graphic matroids, that unifies these two existing classes. Unlike frame matroids and lifted‐graphic matroids, it is easy to certify that a 3‐connected matroid is quasi‐graphic. The main result is that every 3‐connected representable quasi‐graphic matroid is either a lifted‐graphic matroid or a frame matroid.     

Circuit Admissible Triangulations of Oriented Matroids

All triangulations of euclidean oriented matroids are of the same PL-homeo-morphism type by a result of Anderson. That means all triangulations of euclidean acyclic oriented matroids are PL-homeomorphic to PL-balls and that all triangulations of totally cyclic oriented matroids are PL-homeomorphic to PL-spheres. For non-euclidean oriented matroids this question is wide open. One key point in the proof of Anderson is the following fact: for every triangulation of a euclidean oriented matroid the adjacency graph of the set of all simplices ``intersecting' a segment [p _- p ₊ ] is a path. We call this graph the [p _- p ₊ ] -adjacency graph of the triangulation. While we cannot solve the problem of the topological type of triangulations of general oriented matroids we show in this note that for every circuit admissible triangulation of an arbitrary oriented matroid the [p _- p ₊ ] -adjacency graph is a path. Received December 8, 2000, and in revised form May 23, 2001. Online publication November 7, 2001.     

On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids

We introduce the active partition of the ground set of an oriented matroid perspective (or morphism, or quotient, or strong map) on a linearly ordered ground set. The reorientations obtained by arbitrarily reorienting parts of the active partition share the same active partition. This yields an equivalence relation for the set of reorientations of an oriented matroid perspective, whose classes are enumerated by coefficients of the Tutte polynomial, and a remarkable partition of the set of reorientations into Boolean lattices, from which we get a short direct proof of a 4-variable expansion formula for the Tutte polynomial in terms of orientation activities. This formula was given in the last unpublished preprint by Michel Las Vergnas; the above equivalence relation and notion of active partition generalize a former construction in oriented matroids by Michel Las Vergnas and the author; and the possibility of such a proof technique in perspectives was announced in the aforementioned preprint. We also briefly highlight how the 5-variable expansion of the Tutte polynomial in terms of subset activities in matroid perspectives comes in a similar way from the known partition of the power set of the ground set into Boolean lattices related to subset activities (and we complete the proof with a property which was missing in the literature). In particular, the paper applies to matroids and oriented matroids on a linearly ordered ground set, and applies to graph and directed graph homomorphisms on a linearly ordered edge-set.     

Mod 2 cohomology of combinatorial Grassmannians

Matroid bundles, introduced by MacPherson, are combinatorial analogues of real vector bundles. This paper sets up the foundations of matroid bundles. It defines a natural transformation from isomorphism classes of real vector bundles to isomorphism classes of matroid bundles. It then gives a transformation from matroid bundles to spherical quasifibrations, by showing that the geometric realization of a matroid bundle is a spherical quasifibration. The poset of oriented matroids of a fixed rank classifies matroid bundles, and the above transformations give a splitting from topology to combinatorics back to topology. A consequence is that the mod 2 cohomology of the poset of rank k oriented matroids (this poset classifies matroid bundles) contains the free polynomial ring on the first k Stiefel-Whitney classes.     

Oriented matroids and multiply ordered sets

The many different axiomatizations for matroids all have their uses. In this paper we show that Gutierrez Novoa's n-ordered sets are cryptomorphically the same as the oriented matroids, thereby establishing the existence of an axiomatization for oriented matroids in which the “oriented” bases of the matroid are the objects of paramount importance.     

Separation theorems for oriented matroids

In this paper we show that Minty's lemma can be used to prove the Hahn-Banach theorem as well as other theorems in this class such as Radon's and Helly's theorem for oriented matroids having an intersection property which guarantees that every pair of flats intersects in some point extension p of the oriented matroid .     

On the Generation of Oriented Matroids

We provide a multiple purpose algorithm for generating oriented matroids. An application disproves a conjecture of Grünbaum that every closed triangulated orientable 2-manifold can be embedded geometrically in R ³ , i.e., with flat triangles and without self-intersections. We can show in particular that there exists an infinite class of orientable triangulated closed 2-manifolds for each genus g \geq 6 that cannot be embedded geometrically in Euclidean 3-space. Our algorithm is interesting in its own right as a tool for many investigations in which oriented matroids play a key role. Received January 7, 1999, and in final form July 16, 1999.     

On some combinatorial properties of algebraic matroids

It was proved implicitly by Ingleton and Main and explicitly by Lindström that if three lines in the algebraic matroid consisting of all elements of an algebraically closed field are not coplanar, but any two of them are, then they pass through one point. This theorem is extended to a more general result about the intersection of subspaces in full algebraic matroids. This result is used to show that the minimax theorem for matroid matching, proved for linear matroids by Lovász, remains valid for algebraic matroids.