
doi: 10.37236/8742
In 1971, Rota introduced the concept of derived matroids to investigate "dependencies among dependencies" in matroids. In this paper, we study the derived matroid $\delta M$ of an ${\mathbb F}$-representation of a matroid $M$. The matroid $\delta M$ has a naturally associated ${\mathbb F}$-representation, so we can define a sequence $\delta M$, $\delta^2 M$, \dots . The main result classifies such derived sequences of matroids into three types: finite, cyclic, and divergent. For the first two types, we obtain complete characterizations and thereby resolve some of the questions that Longyear posed in 1980 for binary matroids. For the last type, the divergence is estimated by the coranks of the matroids in the derived sequence.
Combinatorial aspects of matroids and geometric lattices
Combinatorial aspects of matroids and geometric lattices
| selected citations These citations are derived from selected sources. 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). | 2 | |
| 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). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
