The Möbius function of the composition poset
Bruce Sagan, Vincent Vatter
Abstract
We determine the Möbius function of the poset of compositions of an integer. In fact we give two proofs of this formula, one using an involution and one involving discrete Morse theory. The composition poset turns out to be intimately connected with subword order, whose Möbius function was determined by Björner. We show that using a generalization of subword order, we can obtain both Björner's results and our own as special cases.
Create a lesson
Related papers
Szemerédi's theorem with random differences and arithmetic Kakeya
Gabriel Dahia
A proof of the rational exponents conjecture
David Conlon, Oliver Janzer, Tao Jiang et al.
Proofs of four Takigiku--Tsuchioka conjectures on level 2 principal characters of A2-1(2)
Liuquan Wang
Two conjectures on the cospectrality of complete tripartite graphs are false
Irena M. Jovanović, Jelena Sedlar, Riste Škrekovski
Saturation and semisaturation of oriented graphs
Vladimir Bošković, Balázs Keszegh
Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity
Jia Wei, Muhuo Liu, Zhifu You et al.