𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A quantifier for matroid duality

✍ Scribed by T.A. McKee


Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
480 KB
Volume
34
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


A quantikr is introduced on the elements e, , . .". The sr;qtroid dual of this quantifier is sholvn to be identical with its logkal dual, and this provides an elegant reformulation of Minty's sd2lf+iual axiomatization of mat&is. This approach also provides a practical, and in a sense optimal, n~ans of taking a statement in terms of circuits and constructing its dual, still in terms of &c&s.


πŸ“œ SIMILAR VOLUMES


Strong Duality Property for Matroids wit
✍ Marc Wagowski πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 305 KB

The duality of infinite matroids with coefficients defined in [1] and the duality of Klee matroids [5], a generalization to the infinite case of matroid closure operators, are not identical. In this paper we characterize those Klee matroids arising as closure operators of matroids with coefficients.

Duality principles for binary matroids a
✍ T.A. McKee πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 750 KB

In hopes of better understanding graph-theoretic duality, a syntactical 'duality principle' is proved for circuit-cutset duality in binary matroids. The principle is shown to characterize binarity, and its theoretical and practicat applicability is discussed.

A characterization of orthogonal duality
✍ Joseph P. S. Kung πŸ“‚ Article πŸ“… 1983 πŸ› Springer 🌐 English βš– 140 KB

An operation on matroids is a function defined from the collection of all matroids on finite sets to itself which preserves isomorphism of matroids and sends a matroid on a set S to a matroid on the same set S. We show that orthogonal duality is the only non-trivial operation on matroids which inter

A Quantifier for Isomorphisms
✍ J. Ouko VÀÀnΓ€nen πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 521 KB
A composition for matroids
✍ Robert E Bixby πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 935 KB
A construction for binary matroids
✍ Francisco Barahona; Michele Conforti πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 384 KB

A family of subsets of a ground set closed under the operation of taking symmetric differences is the family of cycles of a binary matroid. Its circuits are the minimal members of this collection. We use this basic property to derive binary matroids from binary matroids. In particular, we derive two