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. A preorder-free cons ...
Conference paper

A preorder-free construction of the Kazhdan-Lusztig representations of $S_n$, with connections to the Clausen representations

Charles Buehrle (1), Mark Skandera ORCID (1)
(1) Department of Mathematics [Bethlehem, USA]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2008
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
Proceedings
DOI
10.46298/dmtcs.2736
License
https://about.hal.science/hal-authorisation-v1
Indicators
558
Views
575
Downloads

A preorder-free construction of the Kazhdan-Lusztig representations of $S_n$, with connections to the Clausen representations

Charles Buehrle (1), Mark Skandera ORCID (1)
(1) Department of Mathematics [Bethlehem, USA]
Abstract
English
We use the polynomial ring $\mathbb{C}[x_{1,1},\ldots,x_{n,n}]$ to modify the Kazhdan-Lusztig construction of irreducible $S_n$-modules. This modified construction produces exactly the same matrices as the original construction in [$\textit{Invent. Math}$ $\mathbf{53}$ (1979)], but does not employ the Kazhdan-Lusztig preorders. We also show that our modules are related by unitriangular transition matrices to those constructed by Clausen in [$\textit{J. Symbolic Comput.}$ $\textbf{11}$ (1991)]. This provides a $\mathbb{C}[x_{1,1},\ldots,x_{n,n}]$-analog of results of Garsia-McLarnan in [$\textit{Adv. Math.}$ $\textbf{69}$ (1988)].
French
Nous utilisons l'anneau $\mathbb{C}[x_{1,1},\ldots,x_{n,n}]$ pour modifier la construction Kazhdan-Lusztig des modules-$S_n$ irréductibles dans $\mathbb{C}[S_n]$. Cette construction modifiée produit exactement les mêmes matrices que la construction originale dans [$\textit{Invent. Math}$ $\mathbf{53}$ (1979)], mais sans employer les préordres de Kazhdan-Lusztig. Nous montrons aussi que nos modules sont reliés par des matrices unitriangulaires aux modules construits par Clausen dans [$\textit{J. Symbolic Comput.}$ $\textbf{11}$ (1991)]. Ce résultat donne un $\mathbb{C}[x_{1,1},\ldots,x_{n,n}]$-analogue des résultats de Garsia-McLarnan dans [$\textit{Adv. Math.}$ $\textbf{69}$ (1988)].
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Kazhdan-Lusztig
  • immanants
  • irreducible representations
  • symmetric group
Preview
Loading PDF preview...