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. Refinements of the L ...
Conference paper

Refinements of the Littlewood-Richardson rule

J. Haglund ORCID (1) (2), K. Luoto (3), S. Mason ORCID (4), S. van Willigenburg (5) (6)
(1) University of Pennsylvania
(2) University of Pennsylvania [Philadelphia]
(3) University of Washington [Seattle]
(4) Davidson College
(5) University of British Columbia
(6) University of British Columbia [Canada]
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.2744
License
https://about.hal.science/hal-authorisation-v1
unidentified
Indicators
607
Views
775
Downloads

Refinements of the Littlewood-Richardson rule

J. Haglund ORCID (1) (2), K. Luoto (3), S. Mason ORCID (4), S. van Willigenburg (5) (6)
(1) University of Pennsylvania
(2) University of Pennsylvania [Philadelphia]
(3) University of Washington [Seattle]
(4) Davidson College
(5) University of British Columbia
(6) University of British Columbia [Canada]
Abstract
English
We refine the classical Littlewood-Richardson rule in several different settings. We begin with a combinatorial rule for the product of a Demazure atom and a Schur function. Building on this, we also describe the product of a quasisymmetric Schur function and a Schur function as a positive sum of quasisymmetric Schur functions. Finally, we provide a combinatorial formula for the product of a Demazure character and a Schur function as a positive sum of Demazure characters. This last rule implies the classical Littlewood-Richardson rule for the multiplication of two Schur functions.
French
Nous décrivons trois nouvelles règles de Littlewood-Richardson, et chaque nouvelle règle partage la vieille règle de Littlewood-Richardson. La première règle multiplie un atome de Demazure et une fonction de Schur. La deuxième multiplie une fonction de quasisymmetric-Schur et une fonction de Schur. La troisième multiplie un caractère de Demazure et une fonction de Schur. Cette dernière règle est une description de la vieille règle de Littlewood-Richardson.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • key polynomials
  • nonsymmetric Macdonald polynomials
  • Littlewood-Richardson rule
  • quasisymmetric functions
  • Schur functions
Preview
Loading PDF preview...