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

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...

Täydet tiedot

Bibliografiset tiedot

Päätekijät:	F. Descouens, H. Morita, Y. Numata
Aineistotyyppi:	Artigo
Kieli:	Inglês
Julkaistu:	Discrete Mathematics & Theoretical Computer Science 2008-01-01
Sarja:	Discrete Mathematics & Theoretical Computer Science
Aiheet:	macdonald polynomials roots of unity [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Linkit:	https://dmtcs.episciences.org/3593/pdf
Tagit:	Lisää tagi Ei tageja, Lisää ensimmäinen tagi!