Search arXivSearch

arXiv · 2412.00116

$q$-Whittaker polynomials: bases, branching and direct limits

Abstract

We study $q$-Whittaker polynomials and their monomial expansions given by the fermionic formula, the inv statistic of Haglund-Haiman-Loehr and the quinv statistic of Ayyer-Mandelshtam-Martin. The combinatorial models underlying these expansions are partition overlaid patterns and column strict fillings. The former model is closely tied to representations of the affine Lie algebra $\widehat{\mathfrak{sl}_n}$ and admits projections, branching maps and direct limits that mirror these structures in the Chari-Loktev basis of local Weyl modules. We formulate novel versions of these notions in the column strict fillings model and establish their main properties. We construct weight-preserving bijections between the models which are compatible with projection, branching and direct limits. We also establish connections to the coloured lattice paths formalism for $q$-Whittaker polynomials due to Wheeler and collaborators.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aritra Bhattacharya, T V Ratheesh, Sankaran Viswanath. 2024-11-28. $q$-Whittaker polynomials: bases, branching and direct limits. https://arxiv.org/abs/2412.00116

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