✦ LIBER ✦

The lattice of convex sets of an oriented matroid

✍ Scribed by Paul H Edelman

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 269 KB
Volume: 33
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90043-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lattice-theoretical Characterization o

A Lattice-theoretical Characterization of Oriented Matroids

✍ W. Hochstättler 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 311 KB

Automorphism groups of lattices of close

Automorphism groups of lattices of closed convex sets

✍ René Fourneau 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 355 KB

Isomorphisms of lattices of closed conve

Isomorphisms of lattices of closed convex sets, II

✍ R Fourneau 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 304 KB

The convex weighting of a graph and an a

The convex weighting of a graph and an alternative definition of a matroid

✍ Guan Meigu; Li Weixuan; Wang Zheming 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 213 KB

In 1976, R.N

The Cocycle Lattice of Binary Matroids

✍ László Lovász; Ákos Seress 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 330 KB

We study the lattice (grid) generated by the incidence vectors of cocycles of a binary matroid and its dual tattice. We characterize those binary matroids for which the obvious necessary conditions for a vector to belong to the cocycle lattice are also sufficient. This characterization yields a poly

The independent sets of rank k of a matr

The independent sets of rank k of a matroid

✍ G. Purdy 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 466 KB

We determine the minimum num>er of independent sets of arbitrary fixed rank contained in a matroid M as M varies over all simple (respectively loopless) matroids of fixed rank and cardinality.