The $m$-Colored Composition Poset

  • Brian Drake
  • T. Kyle Petersen

Abstract

We define a partial order on colored compositions with many properties analogous to Young's lattice. We show that saturated chains correspond to colored permutations, and that covering relations correspond to a Pieri-type rule for colored quasi-symmetric functions. We also show that the poset is CL-shellable. In the case of a single color, we recover the subword order on binary words.

Published
2007-02-27
How to Cite
Drake, B., & Petersen, T. K. (2007). The $m$-Colored Composition Poset. The Electronic Journal of Combinatorics, 14(1), R23. https://doi.org/10.37236/941
Article Number
R23