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. Reduction formulae f ...
Conference paper

Reduction formulae from the factorization Theorem of Littlewood-Richardson polynomials by King, Tollu and Toumazet

Soojin Cho (1), Eun-Kyoung Jung (1), Dongho Moon ORCID (2)
(1) Department of Mathematics [Ajou]
(2) Department of Applied Mathematics
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2007
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AJ, 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008)
Proceedings
DOI
10.46298/dmtcs.3592
License
https://about.hal.science/hal-authorisation-v1
Indicators
587
Views
822
Downloads

Reduction formulae from the factorization Theorem of Littlewood-Richardson polynomials by King, Tollu and Toumazet

Soojin Cho (1), Eun-Kyoung Jung (1), Dongho Moon ORCID (2)
(1) Department of Mathematics [Ajou]
(2) Department of Applied Mathematics
Abstract
English
The factorization theorem by King, Tollu and Toumazet gives four different reduction formulae of Littlewood-Richardson coefficients. One of them is the classical reduction formula of the first type while others are new. Moreover, the classical reduction formula of the second type is not a special case of KTT theorem. We give combinatorial proofs of reduction formulae in terms of tableaux or hives. The proofs for the cases $r=1, 2, n-2$ in terms of tableaux and the proof for the classical reduction formula of the second type in terms of hives are new.
French
Le Théorème de factorisation par King, Tollu, et Toumazet donne quatre formules différentes de réduction des coefficients de Littlewood-Richardson. L'une d'entre eux est la formule classique de réduction du premier type alors que les trois autres sont nouvelles. De plus, la formule classique de réduction du deuxième type n'est pas un cas spécial du KTT théorème. Nous donnons preuves combinatoires des formules de réduction en termes de tableaux ou $\textit{hives}$. Les preuves pour les cas $r = 1, 2, n-2$ en termes de tableaux et la preuve pour la formule classique de réduction du deuxième type en termes de $\textit{hives}$ sont nouvelles.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Reduction formulae
  • KTT factorization theorem
  • Littlewood-Richardson coefficients
Cited by

Source: OpenCitations

  • A Hive-Model Proof of the Second Reduction Formula of Littlewood-Richardson Coefficients

    Annals of Combinatorics

    Authors : Soojin Cho ORCID, Eun-Kyoung Jung, Dongho Moon ORCID

    Journal reference : Volume 15, 2011, pp. 223-231

    DOI : 10.1007/s00026-011-0091-8
Preview
Loading PDF preview...