Large convex sets in oriented matroids
โ Scribed by J.Richard Buchi; William E Fenton
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 653 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
Let A be a finite set of points in general position in Rd, d 2 2. Points a,, a2, , a, E A form an n-hole in A (an empty convex subset of A) if they are vertices of a convex polytope containing no other point of A. Let h(d) denote the maximum number h such that any sufficiently large set of points in
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