Direct sum decompositions of matroids and exponential structures
The author associates to a simple matroid (resp. a geometric lattice) \(M\) and a number \(d\) dividing the rank of \(M\) a partially ordered set \({\mathcal D}_d(M)\) whose upper intervals are (set-) partition lattices. Indeed, for some important cases they are exponential structures in the sense of Stanley. This 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 \({\mathcal D}_d(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. By analyzing the shelling, the author derives some facts about the descending chains and applies these techniques to retrieve the results of Wachs about descending chains in the lattice of \(d\)-divisible partitions. A formula for the Möbius number of the poset of direct sum decompositions of a vector space is also obtained in the paper.
- Exponential Dowling structures
- scientific article; zbMATH DE number 3845640 (Why is no real title available?)
- scientific article; zbMATH DE number 1932376 (Why is no real title available?)
- Discrete Morse functions from lexicographic orders
- A semigroup-theoretical view of direct-sum decompositions and associated combinatorial problems
- Heaps and two exponential structures
- Shellability of exponential structures
- Two results on the rank partition of a matroid
- Posets arising from decompositions of objects in a monoidal category
- The common basis complex and the partial decomposition poset
- Enumerative combinatorics. Abstracts from the workshop held January 11--16, 2026
This page was built for publication: Direct sum decompositions of matroids and exponential structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892844)