Skip to main content
Log in

A Bijective Proof of a Factorization Formula for Specialized Macdonald Polynomials

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract

Let μ and ν = (ν 1, . . . , ν k ) be partitions such that μ is obtained from ν by adding m parts of size r. Descouens and Morita proved algebraically that the modified Macdonald polynomials \({{\tilde{H}_\mu}(X; q, t)}\) satisfy the identity \({{\tilde{H}_\mu} = \tilde{H}_\nu \tilde{H}_{(r^m)}}\) when the parameter t is specialize to an mth root of unity. Descouens, Morita, and Numata proved this formula bijectively when rν k and \({r \in \{1, 2\}}\) . This note gives a bijective proof of the formula for all rν k .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Descouens F., Morita H.: Factorization formulas for Macdonald polynomials. European J. Combin. 29(2), 395–410 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Descouens, F., Morita, H., Numata, Y.: A bijective proof of a factorization formula for Macdonald polynomials at roots of unity. In: 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), pp. 471–482. Assoc. Discrete Math. Theor. Comput. Sci., Nancy (2008)

  3. Foata D.: On the Netto inversion number of a sequence. Proc. Amer. Math. Soc. 19, 236–240 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  4. Garsia A.M., Haiman M.: A remarkable q, t-Catalan sequence and q-Lagrange inversion. J. Algebraic Combin. 5(3), 191–244 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Haglund J.: A combinatorial model for the Macdonald polynomials. Proc. Natl. Acad. Sci. USA 101(46), 16127–16131 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Haglund J., Haiman M., Loehr N.: A combinatorial formula for Macdonald polynomials. J. Amer. Math. Soc. 18(3), 735–761 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Haglund J., Haiman M., Loehr N.: Combinatorial theory of Macdonald polynomials I: proof of Haglund’s formula. Proc. Natl. Acad. Sci. USA 102(8), 2690–2696 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Loehr N.: Bijective Combinatorics. CRC Press, Boca Raton, FL (2011)

    MATH  Google Scholar 

  9. Loehr N., Niese E.: Recursions and divisibility properties for combinatorial Macdonald polynomials. Discrete Math. Theor. Comput. Sci. 13(1), 21–42 (2011)

    MathSciNet  Google Scholar 

  10. Macdonald, I.: A new class of symmetric functions. S´em. Lothar. Combin. 20, Art. B20a (1988)

  11. Macdonald I.G.: Symmetric Functions and Hall Polynomials. 2nd Edit. Oxford University Press, New York (1995)

    MATH  Google Scholar 

  12. Niese, E.: Combinatorial properties of the Hilbert series ofMacdonald polynomials, Ph.D. Thesis, Virginia Tech, Blacksburg (2010)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nicholas A. Loehr.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Loehr, N.A., Niese, E. A Bijective Proof of a Factorization Formula for Specialized Macdonald Polynomials. Ann. Comb. 16, 815–828 (2012). https://doi.org/10.1007/s00026-012-0162-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-012-0162-5

Mathematics Subject Classification

Keywords

Navigation