𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the coordinatization of oriented matroids

✍ Scribed by Jürgen Bokowski; Bernd Sturmfels

Publisher
Springer
Year
1986
Tongue
English
Weight
653 KB
Volume
1
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coordinatization of B-matroids
Coordinatization of B-matroids
✍ Marc Wagowski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 934 KB

Wagowski, M., Coordinatization of B-matroids, Discrete Mathematics 111 (1993) 465-479. We prove that the class of C-matroids whose circuits intersect cocircuits on finite sets is closed under the taking of minors, and we show that through the concept of matroids with coefficients it is possible to

A homotopy theorem on oriented matroids
A homotopy theorem on oriented matroids
✍ R. Cordovil; M.L. Moreira 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Consider a finite family of hyperplanes \_%? = {Hi, . \_. , H,} in the finite-dimensional vector space IWd. We call chambers (determined by 2) the connected components of W"\ U y=, Hi. Galleries are finite families of chambers (C,,,C,, , C,), where exactly one hyperplane separates Ci+i from Ci, for

On a Mutation Problem for Oriented Matro
On a Mutation Problem for Oriented Matroids
✍ Jürgen Bokowski; Holger Rohlfs 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 469 KB

For uniform oriented matroids M with n elements, there is in the realizable case a sharp lower bound L r (n) for the number mut(M) of mutations of M : L r (n) = n ≤ mut(M), see Shannon [17]. Finding a sharp lower bound L(n) ≤ mut(M) in the non-realizable case is an open problem for rank d ≥ 4. Las V

Total Polynomials of Uniform Oriented Ma
Total Polynomials of Uniform Oriented Matroids
✍ Jim Lawrence 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 120 KB

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