The $m$-colored composition poset
| dc.creator | Drake, Brian | |
| dc.creator | Petersen, T. Kyle | |
| dc.date | 2005-12-15 | |
| dc.date.accessioned | 2026-07-07T06:55:21Z | |
| dc.date.available | 2026-07-07T06:55:21Z | |
| dc.description | We generalize Bjö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ö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. | |
| dc.description | 12 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0512369 | |
| dc.identifier | http://arxiv.org/abs/math/0512369 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/106253 | |
| dc.subject | Combinatorics | |
| dc.subject | Primary 06A07; Secondary 05A99, 52B22 | |
| dc.title | The $m$-colored composition poset | |
| dc.type | text |