Abstract
We associate to a simple matroid (resp. a geometric lattice) M and a number d dividing the rank of M a partially ordered set Dd(M) whose upper intervals are (set-) partition lattices. Indeed, for some important cases they are exponential structures in the sense of Stanley [11]. Our construction includes the partition lattice, the poset of partitions whose size is divisible by a fixed number d, and the poset of direct sum decompositions of a finite vector space. If M is a modularly complemented matroid the posets Dd(M) are CL-shellable. This generalizes results of Sagan and Wachs and settles the open problem of the shellability of the poset of direct sum decompositions. We analyse the shelling and derive some facts about the descending chains. We can apply these techniques to retrieve the results of Wachs about descending chains in the lattice of d-divisible partitions. We also derive a formula for the Möbius number of the poset of direct sum decompositions of a vector space. © 1995 Academic Press, Inc.
Cite
CITATION STYLE
Welker, V. (1995). Direct sum decompositions of matroids and exponential structures. Journal of Combinatorial Theory, Series B, 63(2), 222–244. https://doi.org/10.1006/jctb.1995.1017
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.