Search arXivSearch

arXiv · 2601.04409

Positive expansions of permuted basement and quasisymmetric Macdonald polynomials at $t=0$

Abstract

It is well known that the $q$-Whittaker polynomials, which are $t=0$ specializations of the Macdonald polynomials $P_λ(X;q,t)$, expand positively as the sum of Schur polynomials. Macdonald polynomials have a quasisymmetric refinement: the quasisymmetric Macdonald polynomials $G_γ(X;q,t)$, and a nonsymmetric refinement: the ASEP polynomials $f_α(X;q,t)$. We study the $t=0$ specializations of both these families of polynomials and show analogous properties: the quasisymmetric Macdonald polynomials expand positively as a sum of quasisymmetric Schur functions, $\text{QS}_γ(X)$, and the ASEP polynomials expand positively as a sum of Demazure atoms, $\mathcal{A}_α(X)$. As a corollary of the latter, we prove more generally that any permuted basement Macdonald polynomial has a positive expansion in the Demazure atoms at $t=0$. We give a description of the structure coefficients of $G_γ(X;q,0)$ and $f_α(X;q,0)$ in both cases in terms of the charge statistic on a restricted set of semistandard tableaux.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olya Mandelshtam, Harper Niergarth, Kartik Singh. 2026-01-07. Positive expansions of permuted basement and quasisymmetric Macdonald polynomials at $t=0$. https://arxiv.org/abs/2601.04409

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO