The r-depth of a matroid
✍ Scribed by J.A. Dias da Silva; Amélia Fonseca
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 337 KB
- Volume
- 141
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
We introduce the concept of depth and r-depth of a matroid M, proving that the sequence of the r-depths is the conjugate partition of the rank partition of M. The notion of quasitransversal is defined and its properties stated. We also present connections between the concept of r-depth, the quasi-transversals of M and the circuits of the kth power of M.
📜 SIMILAR VOLUMES
We define the basis monomial ring M, of a matroid G and prove that it is Cohen-Macaulay for finite G. We then compute the Krull dimension of M, , which is the rank over Q of the basis-point incidence matrix of G, and prove that dim B, > dim M, under a certain hypothesis on coordinatizability of G, w
We show that the set of r-quasi-transversals of a matroid, if nonempty, is the set of bases of a matroid. We also give an alternative proof of the known theorem which identifies the conjugate of the rank partition of a matroid.
8% show that for my group If (Bnhc of infhitee) there exists an indepmdence structure with autans~~qMsm gruep i.wmcwphic ts ff. The pmof is by construction and shows that 5 1 Introduction We show &at for any graup N f'finite CH infinite) there exists an independence structure with autamorphism grou
The concept of a combinatorial W P U -geometry for a Coxeter group W , a subset P of its generating involutions and a subgroup U of W with P ⊆ U yields the combinatorial foundation for a unified treatment of the representation theories of matroids and of even -matroids. The concept of a W P -matroid