×

Characterizations of finitary and cofinitary binary matroids. (English) Zbl 0668.05021

This paper extends the many different characterizations of finite binary matroids to finitary and cofinitary matroids on infinite sets. In addition to the classical condition and by generalization of Lucas’ results, we obtain the following.
Let M(S) be a finitary or a confinitary matroid and for a fixed base B of M(S), let us denote by (C(x): \(x\in S-B)\) the family of fundamental circuits defined by B. The following statements about M(S) are equivalent:
(1) M(S) is binary.
(2) For every non-empty set \(\{x_ 1,...,x_ n\}\subseteq S-B\), the symmetric difference \(C(x_ 1)\Delta...\Delta C(x_ n)\) contains a circuit.
(3) (i) M(S) has no minor isomorphic to the matroid \(W^ 3\) (whirl of order 3), and (ii) for x, \(y\in S-B\), \(x\neq y\), C(x)\(\cap C(y)\neq \emptyset\) implies C(x)\(\Delta\) C(y) is a circuit.
(4) For every modular pair \((C_ 1,C_ 2)\) of circuits, \(C_ 1-B\neq C_ 2-B\).

MSC:

05B35 Combinatorial aspects of matroids and geometric lattices
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Crapo, H. H.; Rota, G. C., Combinatorial Geometries (1970), M.I.T. Press · Zbl 0216.02101
[2] Fournier, J. C., Une relation de separation entre cocircuits d’un matroide, J. Combin. Theory B, 16, 181-190 (1974) · Zbl 0271.05010
[3] Fournier, J. C., A characterization of binary geometries by a double elimination axiom, J. Combin. theory B, 31, 249-250 (1981) · Zbl 0469.05024
[4] Higgs, D. A., Matroids and duality, Colloq. Math, 20, 215-220 (1969) · Zbl 0192.33402
[5] Klee, V., The greedy algorithm for finitary and cofinitary matroids, (Combinatorias, Proc. Symp. Pure Math, XIX (1971), Amer. Math. Soc: Amer. Math. Soc Providence, R.I.), 137-152 · Zbl 0229.05031
[6] LasVergnas, M., Fundamental circuits and a characterization of binary matroids, Disc. Math, 31, 327 (1980)
[7] Lehman, A., A solution of the Shannon switching game, J. Soc. Indust. Appl. Math., 12, 637-725 (1964) · Zbl 0137.38704
[8] Lucas, D., Weak maps of combinatorial geometries, Trans. Amer. Math. Soc, 206, 247-279 (1975) · Zbl 0329.05015
[9] Mason, J. H., Representation of independence spaces (1969), University of Wisconsin, Ph.D. Dissertation
[10] Oxley, J. G., Infinite matroids, Proc. London Math. Soc, 3, 37, 259-272 (1978) · Zbl 0436.05017
[11] Piff, M. J., Properties of finite character of independence spaces, Mathematika, 201-208 (1971) · Zbl 0235.05014
[12] Rado, R., Axiomatic treatment of rank in infinite sets, Can. J. Math, 1, 337-343 (1949) · Zbl 0033.25302
[13] Robert, P., Sur l’axiomatique des systemes generateurs, des rangs .... (1966), These: These Rennes · Zbl 0237.08013
[14] Seymour, P. D., The forbidden minors of binary clutters, J. London Math. Soc., 2, 12, 356-360 (1976) · Zbl 0351.05023
[15] Tutte, W. T., Lectures on matroids, J. Res. Nat. Bur. Stand, 69B, 1-47 (1965) · Zbl 0151.33801
[16] Welsh, D. J.A., Matroid Theory, (London Math. Soc. Monographs no. 8 (1976), Academic Press: Academic Press New York London) · Zbl 0343.05002
[17] Whitney, H., On the abstract properties of linear dependence, Amer. J. Math., 57, 509-533 (1935) · JFM 61.0073.03
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.