Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Poset binomials and ...
Conference paper

Poset binomials and rainbow characters

Daniel Bragg (1), Nathaniel Thiem (1)
(1) University of Colorado [Boulder]
Download article
Open on HAL
Imported on
November 20, 2016
Published on
December 31, 2012
Last modified on
April 1, 2025
Volume
DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Proceedings
DOI
10.46298/dmtcs.12806
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
0854893
FRG: Collaborative Research: Characters, Liftings, and Types: Investigations in p-adic Representation Theory
Indicators
463
Views
462
Downloads

Poset binomials and rainbow characters

Daniel Bragg (1), Nathaniel Thiem (1)
(1) University of Colorado [Boulder]
Abstract
English
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.
French
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • q-binomials
  • posets
  • supercharacters
  • set partitions
Preview
Loading PDF preview...