pith. sign in

arxiv: 2210.11286 · v1 · pith:JIMR4YNSnew · submitted 2022-10-20 · 🧮 math.CO

Bijective proofs of some coinversion identities related to Macdonald polynomials

classification 🧮 math.CO
keywords identitiesbijectionsbijectivecoinversionformulamacdonaldpolynomialsproblem
0
0 comments X
read the original 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 $\tilde{H}_{\mu}$. Those authors used intricate algebraic manipulations of $q$-binomial coefficients to prove these identities, which imply the existence of certain bijections needed in their proof that their formula satisfies the axioms characterizing $\tilde{H}_{\mu}$. They posed the open problem of constructing such bijections explicitly. We resolve that problem here.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.