Abacus proofs of Schur expansions of Macdonald polynomials
HTML articles powered by AMS MathViewer
- by Nicholas A. Loehr;
- Proc. Amer. Math. Soc. 151 (2023), 59-71
- DOI: https://doi.org/10.1090/proc/16092
- Published electronically: August 12, 2022
- HTML | PDF | Request permission
Abstract:
A famous problem in symmetric function theory is to find combinatorial formulas for Schur expansions of the Macdonald polynomials $\tilde {H}_{\mu }$. One such formula, valid for $\mu$ satisfying $\mu _1\leq 3$ and $\mu _2\leq 2$, involves Yamanouchi words weighted by Haglund’s statistics $\operatorname {inv}_{\mu }$ and $\operatorname {maj}_{\mu }$. Previous proofs of this formula use the technical machinery of crystals and dual equivalence graphs. We give a new, elementary, and fully bijective proof of this formula based on the abacus model for antisymmetrized Macdonald polynomials. An extension to the Schur expansion of $s_{\nu }\tilde {H}_{\mu }$ is also provided.References
- Sami H. Assaf, Dual equivalence graphs I: A new paradigm for Schur positivity, Forum Math. Sigma 3 (2015), Paper No. e12, 33. MR 3376739, DOI 10.1017/fms.2015.15
- Jonah Blasiak, Haglund’s conjecture on 3-column Macdonald polynomials, Math. Z. 283 (2016), no. 1-2, 601–628. MR 3489082, DOI 10.1007/s00209-015-1612-7
- Susanna Fishel, Statistics for special $q,t$-Kostka polynomials, Proc. Amer. Math. Soc. 123 (1995), no. 10, 2961–2969. MR 1264811, DOI 10.1090/S0002-9939-1995-1264811-3
- J. Haglund, A combinatorial model for the Macdonald polynomials, Proc. Natl. Acad. Sci. USA 101 (2004), no. 46, 16127–16131. MR 2114585, DOI 10.1073/pnas.0405567101
- J. Haglund, M. Haiman, and N. Loehr, A combinatorial formula for Macdonald polynomials, J. Amer. Math. Soc. 18 (2005), no. 3, 735–761. MR 2138143, DOI 10.1090/S0894-0347-05-00485-6
- L. Lapointe and J. Morse, Tableaux statistics for two part Macdonald polynomials, Algebraic combinatorics and quantum groups, World Sci. Publ., River Edge, NJ, 2003, pp. 61–84. MR 2035130, DOI 10.1142/9789812775405_{0}004
- Nicholas A. Loehr, Abacus proofs of Schur function identities, SIAM J. Discrete Math. 24 (2010), no. 4, 1356–1370. MR 2735928, DOI 10.1137/090753462
- Nicholas A. Loehr, Combinatorics, 2nd ed., Discrete Mathematics and its Applications (Boca Raton), CRC Press, Boca Raton, FL, 2018. MR 3791447
- Nicholas A. Loehr, Variants of the RSK algorithm adapted to combinatorial Macdonald polynomials, J. Combin. Theory Ser. A 146 (2017), 129–164. MR 3574226, DOI 10.1016/j.jcta.2016.09.002
- Ian Macdonald, A new class of symmetric functions, Actes du 20e Séminaire Lotharingien, vol. 372/S-20, 1988, pp. 131–171.
- I. G. Macdonald, Symmetric functions and Hall polynomials, 2nd ed., Oxford Mathematical Monographs, The Clarendon Press, Oxford University Press, New York, 1995. With contributions by A. Zelevinsky; Oxford Science Publications. MR 1354144
- Austin Roberts, Dual equivalence graphs revisited and the explicit Schur expansion of a family of LLT polynomials, J. Algebraic Combin. 39 (2014), no. 2, 389–428. MR 3159257, DOI 10.1007/s10801-013-0452-y
- Mike Zabrocki, Positivity for special cases of $(q,t)$-Kostka coefficients and standard tableaux statistics, Electron. J. Combin. 6 (1999), Research Paper 41, 36. MR 1725705, DOI 10.37236/1473
Bibliographic Information
- Nicholas A. Loehr
- Affiliation: Department of Mathematics, Virginia Tech, Blacksburg, Virginia 24061-0123
- MR Author ID: 659737
- Email: nloehr@vt.edu
- Received by editor(s): December 9, 2021
- Received by editor(s) in revised form: March 12, 2022
- Published electronically: August 12, 2022
- Additional Notes: This work was supported by a grant from the Simons Foundation/SFARI (#633564 to the author)
- Communicated by: Isabella Novik
- © Copyright 2022 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 151 (2023), 59-71
- MSC (2020): Primary 05A19, 05E05
- DOI: https://doi.org/10.1090/proc/16092
- MathSciNet review: 4504607