Bijective proofs of some coinversion identities related to Macdonald polynomials
Combinatorics
2022-10-21 v1
Abstract
This paper gives bijective proofs of some novel coinversion identities first discovered by Ayyer, Mandelshtam, and Martin (arxiv:2011.06117) as part of their proof of a new combinatorial formula for the modified Macdonald polynomials . Those authors used intricate algebraic manipulations of -binomial coefficients to prove these identities, which imply the existence of certain bijections needed in their proof that their formula satisfies the axioms characterizing . They posed the open problem of constructing such bijections explicitly. We resolve that problem here.
Keywords
Cite
@article{arxiv.2210.11286,
title = {Bijective proofs of some coinversion identities related to Macdonald polynomials},
author = {Nicholas A. Loehr},
journal= {arXiv preprint arXiv:2210.11286},
year = {2022}
}
Comments
10 pages