The m-colored composition poset

zbMATH Open1110.06004arXivmath/0512369MaRDI QIDQ870085FDOQ870085

Authors: Brian Drake, T. Kyle Petersen 

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We generalize Bj"{o}rner and Stanley's poset of compositions to $m$-colored compositions. Their work draws many analogies between their (1-colored) composition poset and Young's lattice of partitions, including links to (quasi-)symmetric functions and representation theory. Here we show that many of these analogies hold for any number of colors. While many of the proofs for Bj"{o}rner and Stanley's poset were simplified by showing isomorphism with the subword order, we remark that with 2 or more colors, our posets are not isomorphic to a subword order.

Full work available at URL: https://arxiv.org/abs/math/0512369

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Colored posets and colored quasisymmetric functions
• Standard paths in another composition poset
• On posets of \(m\)-ary words
• Posets of shuffles
• The Möbius function of a composition poset

zbMATH Keywords

partial ordercolored permutationsquasi-symmetric functionscolored compositionssubword ordercovering relationssaturated chains

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Shellability for polytopes and polyhedra (52B22)

Cited In (1)

• Colored compositions, invert operator and elegant compositions with the ``black tie

This page was built for publication: The \(m\)-colored composition poset

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870085)