✦ LIBER ✦

Completeness in oriented matroids

✍ Scribed by William E. Fenton

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 665 KB
Volume: 66
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90120-8

No coin nor oath required. For personal study only.

✦ Synopsis

The oriented matroid is a structure combining the notions of independent set and opposite element. Dependence induces a closure operator which in the vector space model is the convex hull. Weak completeness is defined as having every maximal convex set contain a maximal subspace; completeness means that every subspace is weakly complete. It is shown that all finite oriented matroids are complete, that in many infinite cases there is an easy criterion for completeness, and that in the vector space model completeness is equivalent to (Dedekind) completeness of the underlying field. A brief discussion of the axioms and basic properties of oriented matroids is also included.

📜 SIMILAR VOLUMES

Testing Orientability for Matroids is NP

Testing Orientability for Matroids is NP-Complete

✍ Jürgen Richter-Gebert 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Matroids and oriented matroids are fundamental objects in combinatorial geometry. While matroids model the behavior of vector configurations over general fields, oriented matroids model the behavior of vector configurations over ordered fields. For every oriented matroid there is a corresponding und

Bases in oriented matroids

✍ Michel Las Vergnas 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 366 KB

Oriented Lagrangian Matroids

✍ Richard F. Booth; Alexandre V. Borovik; Israel M. Gelfand; Neil White 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 201 KB

In this paper we present a definition of oriented Lagrangian symplectic matroids and their representations. Classical concepts of orientation and this extension may both be thought of as stratifications of thin Schubert cells into unions of connected components. The definitions are made first in ter

Max-balanced flows in oriented matroids

✍ Mark Hartmann; Michael H. Schneider 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 863 KB

Let M =(E, d~) be an oriented matroid on the ground set E. A real-valued vector x defined on E is a max-balanced flow for M if for every signed cocircuit Y~(.9 ±, we have maxe~y+xe=maxe~r-x e. We extend the admissibility and decomposition theorems of Hamacher from regular to general oriented matroid

Large convex sets in oriented matroids

✍ J.Richard Buchi; William E Fenton 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 653 KB

Invariant Theory-like Theorems for Matro

Invariant Theory-like Theorems for Matroids and Oriented Matroids

✍ J. Bokowski; A.G. Deoliveira 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 394 KB