Search arXivSearch

arXiv · 2506.09015

Flagged LLT polynomials, nonsymmetric plethysm, and nonsymmetric Macdonald polynomials

Abstract

The plethystic transformation $f[X] \mapsto f[X/(1-t)]$ and LLT polynomials are central to the theory of symmetric Macdonald polynomials. In this work, we introduce and study nonsymmetric flagged LLT polynomials. We show that these admit both an algebraic and a combinatorial description, that they Weyl symmetrize to the usual symmetric LLT polynomials, and we conjecture that they expand positively in terms of Demazure atoms. Additionally, we construct a nonsymmetric plethysm operator $Π_{t,x}$ on $\mathfrak{K}[x_1,\ldots,x_n]$, which serves as an analogue of $f[X] \mapsto f[X/(1-t)]$. We prove that $Π_{t,x}$ remarkably maps flagged LLT polynomials defined over a signed alphabet to ones over an unsigned alphabet. Our main application of this theory is to formulate a nonsymmetric version of Macdonald positivity, similar in spirit to conjectures of Knop and Lapointe, but with several new features. To do this, we recast the Haglund-Haiman-Loehr formula for nonsymmetric Macdonald polynomials $\mathcal{E}_{μ}(x;q,t)$ as a positive sum of signed flagged LLT polynomials. Then, after applying a suitable stable limit of $Π_{t,x}$ to a stable version of $\mathcal{E}_{μ}(x;q,t)$, we obtain modified nonsymmetric Macdonald polynomials which are positive sums of flagged LLT polynomials and thus are conjecturally atom positive, strengthening the Macdonald positivity conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonah Blasiak, Mark Haiman, Jennifer Morse, Anna Pun, George H. Seelinger. 2025-07-28. Flagged LLT polynomials, nonsymmetric plethysm, and nonsymmetric Macdonald polynomials. https://arxiv.org/abs/2506.09015

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

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO