A composition for matroids
Copyright policy )A composition for matroids
AbstractThe composition of a quotient matroid Q over a collection of component matroids f1, …, fn indexed on the cells of Q, is described. This composition, called quotient composition, may be viewed as an application of clutter composition to matroids, or as a generalization of matroid direct sum composition to the next higher connectivity. It may also be viewed as equivalent to compositions described by Minty in 1966, and Brylawski in 1971.Quotient composition is characterized, and the circuits and rank function of a composed matroid are given. Various other properties are described, along with a category for quotient composition.
- Department of Mathematics
- University of Kentucky United States
Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Combinatorial aspects of matroids and geometric lattices, Theoretical Computer Science
Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Combinatorial aspects of matroids and geometric lattices, Theoretical Computer Science
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).9 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!