English

Combinatorial proof of a permuted basement Macdonald polynomial identity

Combinatorics 2025-08-29 v1 Quantum Algebra Representation Theory

Abstract

A well-known and fundamental property of the Macdonald polynomials Pλ(x;q,t)P_\lambda(x;q,t) is their invariance under the transformation sending (q,t)(q,t) to (q1,t1)(q^{-1},t^{-1}). Recently, Concha and Lapointe showed that this property extends in an interesting, nontrivial way to an identity for partially symmetric Macdonald polynomials. Their identity played a key role in the work of Bechtloff Weising and Orr linking partially symmetric Macdonald polynomials to parabolic flag Hilbert schemes. In this paper, we refine the Concha-Lapointe identity to a sub-family of Alexandersson's permuted basement Macdonald polynomials and give a combinatorial proof of the refined identity. We show also that the Concha-Lapointe identity is equivalent to the assertion that (normalized) partially symmetric Macdonald polynomials are fixed under the Kazhdan-Lusztig involution.

Keywords

Cite

@article{arxiv.2508.20337,
  title  = {Combinatorial proof of a permuted basement Macdonald polynomial identity},
  author = {Daniel Orr and Johnny Rivera},
  journal= {arXiv preprint arXiv:2508.20337},
  year   = {2025}
}
R2 v1 2026-07-01T05:09:27.982Z