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 th
A Lattice-theoretical Characterization of Oriented Matroids
✍ Scribed by W. Hochstättler
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 311 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## 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.
Consider the following question introduced by McMullen: Determine the largest integer n = f (d) such that any set of n points in general position in the affine d-space R d can be mapped by a projective transformation onto the vertices of a convex polytope. It is known that 2d + 1 ≤ f (d) < (d + 1)(d
We investigate the statistics of the coupled hole pairs in a crystal lattice in high T c superconductors, following the previously developed approach for the collective charge state (holon). The exact commutation relations for the hole pair operators correspond to a modified parafermi statistics of