Papers
Topics
Authors
Recent
Search
2000 character limit reached

Type A Partially-Symmetric Macdonald Polynomials

Published 20 Nov 2023 in math.CO | (2311.12216v3)

Abstract: We construct type A partially-symmetric Macdonald polynomials P(λ∣γ)P_{(\lambda \mid \gamma)}, where λ∈Z<em>≥0<sup>n−k\lambda \in \mathbb{Z}<em>{\geq 0}<sup>{n-k} is a partition and γ∈Z</em>≥0<sup>k\gamma \in \mathbb{Z}</em>{\geq 0}<sup>k is a composition. These are polynomials which are symmetric in the first n−kn-k variables, but not necessarily in the final kk variables. We establish their stability and an integral form defined using Young diagram statistics. Finally, we build Pieri-type rules for degree 1 products xjP(λ∣γ)x_j P_{(\lambda \mid \gamma)} for $j &gt; n-k$ and e1[x1,…,xn−k]P(λ∣γ)e_1[x_1, \dotsc, x_{n-k}] P_{(\lambda \mid \gamma)}, along with substantial combinatorial simplification of the e1e_1 multiplication. The P(λ∣γ)P_{(\lambda \mid \gamma)} are the same as the mm-symmetric Macdonald polynomials defined by Lapointe up to a change of variables.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.