A Characterization of the Orientations of Ternary Matroids
β Scribed by Jon Lee; Matt Scobee
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 280 KB
- Volume
- 77
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
β¦ Synopsis
A matroid or oriented matroid is dyadic if it has a rational representation with all nonzero subdeterminants in [ \2 k : k # Z]. Our main theorem is that an oriented matroid is dyadic if and only if the underlying matroid is ternary. A consequence of our theorem is the recent result of G. Whittle that a rational matroid is dyadic if and only if it is ternary. Along the way, we establish that each whirl has three inequivalent orientations. Furthermore, except for the rank-3 whirl, no pair of these are isomorphic.
1999 Academic Press
A rational matrix is totally dyadic if all of its nonzero subdeterminants are in D :=[\2 k : k # Z]. A matroid or oriented matroid is dyadic if it can be represented over Q by a totally dyadic matrix. It is easy to see that dyadic matroids are ternary, since elements of D map to nonzero elements of GF(3) when viewed modulo 3. Hence the matroids that underlie dyadic oriented-matroids are ternary. Our main result is the if '' part of the following theorem (the only if '' part being the simple observation mentioned above).
Theorem 1. Let M be an oriented matroid. Let M be the matroid underlying M. Then M is dyadic if and only if M is ternary.
This theorem resolves a conjecture of J. Lee (Conjecture III.5.5c of [6]) in the positive. We have the following two consequences of our main result.
Corollary 1. Let M be a ternary matroid. If M is orientable, then M is dyadic.
π SIMILAR VOLUMES
Let M and N be ternary matroids having the same rank and the same ground set, and assume that every independent set in N is also independent in M. The main result of this paper proves that if M is 3-connected and N is connected and non-binary, then M = N . A related result characterizes precisely wh
In this paper we introduce polynomials associated with uniform oriented matroids whose coefficients enumerate cells in the corresponding arrangements. These polynomials are quite useful in the study of many enumeration problems of combinatorial geometry, such as counting faces of polytopes, counting
We obtain an explicit method to compute the cd-index of the lattice of regions of an oriented matroid from the ab-index of the corresponding lattice of flats. Since the cd-index of the lattice of regions is a polynomial in the ring Z( c, 2d), we call it the c-2d-index. As an application we obtain a
## Abstract In this paper we present a relatively simple proof of Tutt's characterization of graphic matroids. The proof uses the notion of βsigned graphβ and it is βgraphicβ in the sense that it can be presented almost entirely by drawing (signed) graphs. Β© 1995 John Wiley & Sons, Inc.