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 bijective proof of ...
Conference paper

A bijective proof of a factorization formula for Macdonald polynomials at roots of unity

F. Descouens (1) (2), H. Morita (3), Y. Numata (4)
(1) Fields Institute for Research In Mathematical Sciences
(2) Department of Mathematics and Statistics [Toronto]
(3) Oyama National College of Technology
(4) Department of Mathematics [Sapporo]
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.3593
License
https://about.hal.science/hal-authorisation-v1
Indicators
521
Views
480
Downloads

A bijective proof of a factorization formula for Macdonald polynomials at roots of unity

F. Descouens (1) (2), H. Morita (3), Y. Numata (4)
(1) Fields Institute for Research In Mathematical Sciences
(2) Department of Mathematics and Statistics [Toronto]
(3) Oyama National College of Technology
(4) Department of Mathematics [Sapporo]
Abstract
English
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials $\widetilde{H}_{\lambda} (X;q,t)$ when $t$ is specialized at a primitive root of unity. Our proof is restricted to the special case where $\lambda$ is a two columns partition. We mainly use the combinatorial interpretation of Haiman, Haglund and Loehr giving the expansion of $\widetilde{H}_{\lambda} (X;q,t)$ on the monomial basis.
French
Nous présentons une preuve combinatoire de la formule de factorisation des polynômes de Macdonald modifiés $\widetilde{H}_{\lambda} (X;q,t)$ quand $t$ est spécialisé à une racine primitive de l'unité. Notre preuve se restreint au cas particulier des partitions $\lambda$ n'ayant que deux colonnes. On utilise principalement l'interprétation combinatoire de Haglund, Haiman and Loehr donnant le développement de $\widetilde{H}_{\lambda} (X;q,t)$ sur la base des fonctions monomiales.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Macdonald polynomials
  • roots of unity
Cited by

Source: OpenCitations

  • A Bijective Proof of a Factorization Formula for Specialized Macdonald Polynomials

    Annals of Combinatorics

    Authors : Nicholas A. Loehr ORCID, Elizabeth Niese ORCID

    Journal reference : Volume 16, 2012, pp. 815-828

    DOI : 10.1007/s00026-012-0162-5
Preview
Loading PDF preview...