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
Bases in oriented matroids
โ Scribed by Michel Las Vergnas
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 366 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
Let S be a finite set and M = (S, B) be a matroid where B is the set of its bases. We say that a basis B is greedy in M or the pair (M, B) is greedy if, for every sum of bases vector w, the coefficient: where B and its characteristic vector will not be distinguished, is integer. We define a notion
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