Bijective proofs of some coinversion identities related to Macdonald polynomials

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 Hμ. 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 Hμ. They posed the open problem of constructing such bijections explicitly. We resolve that problem here.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…