Type A Partially-Symmetric Macdonald Polynomials

Abstract

We construct type A partially-symmetric Macdonald polynomials P(λ γ), where λ ∈ Z≥ 0n-k is a partition and γ ∈ Z≥ 0k is a composition. These are polynomials which are symmetric in the first n-k variables, but not necessarily in the final k variables. We establish their stability and an integral form defined using Young diagram statistics. Finally, we build Pieri-type rules for degree 1 products xj P(λ γ) for j > n-k and e1[x1, …c, xn-k] P(λ γ), along with substantial combinatorial simplification of the e1 multiplication. The P(λ γ) are the same as the m-symmetric Macdonald polynomials defined by Lapointe up to a change of variables.

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…