Daniel Bragg ; Nathaniel Thiem - Poset binomials and rainbow characters

dmtcs:12806 - Discrete Mathematics & Theoretical Computer Science, January 1, 2013, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) - https://doi.org/10.46298/dmtcs.12806
Poset binomials and rainbow charactersConference paper

Authors: Daniel Bragg 1; Nathaniel Thiem 1

[en]
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.

[fr]
Cet article présente une variation des coefficients binomiaux qui dépend d’un ordre partiel et qui interpole entre les $q$-binômes et les 1-binômes: un ordre total donne les $q$-binômes habituelles, et un ordre partiel sans relations donne les coefficients binomiaux habituelles. Ces coefficients apparaissent naturellement dans l’étude des supercaractères de groupes finis de matrices unipotentes, triangulaires supérieures, dont la représentation est dictée par la théorie de la combinatoire des partitions d’ensembles. En particulier, nous trouvons un ensemble naturel de modulespour ces groupes, dont les caractères ont des degrés donnés par les $q$-binômes, et dont les décompositions en termes de supercaractères sont donnés par les coefficients binômiaux d’ordres partiels. Cela donne une famille non-trivial de formules qui relient les binômes d’ordres partiels aux$q$-binômes habituelles.


Volume: DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Section: Proceedings
Published on: January 1, 2013
Imported on: November 21, 2016
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] q-binomials, posets, supercharacters, set partitions
Funding:
    Source : OpenAIRE Graph
  • FRG: Collaborative Research: Characters, Liftings, and Types: Investigations in p-adic Representation Theory; Funder: National Science Foundation; Code: 0854893

Consultation statistics

This page has been seen 261 times.
This article's PDF has been downloaded 217 times.