Poset binomials and rainbow characters
Abstrak
This paper introduces a variation on the binomial coefficient that depends on a poset and interpolates between $q$-binomials and 1-binomials: a total order gives the usual $q$-binomial, and a poset with no relations gives the usual binomial coefficient. These coefficients arise naturally in the study of supercharacters of the finite groups of unipotent upper-triangular matrices, whose representation theory is dictated by the combinatorics of set partitions. In particular, we find a natural set of modules for these groups, whose characters have degrees given by $q$-binomials, and whose decomposition in terms of supercharacters are given by poset binomial coefficients. This results in a non-trivial family of formulas relating poset binomials to the usual $q$-binomials.
Topik & Kata Kunci
Penulis (2)
Daniel Bragg
Nathaniel Thiem
Akses Cepat
- Tahun Terbit
- 2013
- Sumber Database
- DOAJ
- DOI
- 10.46298/dmtcs.12806
- Akses
- Open Access ✓