✦ LIBER ✦

The Penrose Polynomial of Binary Matroids

✍ Scribed by Martin Aigner; Hans Mielke

Publisher: Springer Vienna
Year: 2000
Tongue: English
Weight: 117 KB
Volume: 131
Category: Article
ISSN: 0026-9255
DOI: 10.1007/s006050070020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Penrose polynomial of a plane graph

✍ Martin Aigner 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 430 KB

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

Cycle covering of binary matroids

✍ Ury Jamshy; Michael Tarsi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 408 KB

The cocycle lattice of binary matroids,

The cocycle lattice of binary matroids, II

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

The circuit basis in binary matroids

✍ Judith Q Longyear 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 340 KB

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