Search arXivSearch

arXiv · 2207.12590

q-Whittaker functions, finite fields, and Jordan forms

Abstract

The $q$-Whittaker function $W_λ(\mathbf{x};q)$ associated to a partition $λ$ is a $q$-analogue of the Schur function $s_λ(\mathbf{x})$, and is defined as the $t=0$ specialization of the Macdonald polynomial $P_λ(\mathbf{x};q,t)$. We show combinatorially how to expand $W_λ(\mathbf{x};q)$ in terms of partial flags compatible with a nilpotent endomorphism over the finite field of size $1/q$. This yields an expression analogous to a well-known formula for the Hall-Littlewood functions. We show that considering pairs of partial flags and taking Jordan forms leads to a probabilistic bijection between nonnegative-integer matrices and pairs of semistandard tableaux of the same shape, proving the Cauchy identity for $q$-Whittaker functions. We call our probabilistic bijection the $q$-Burge correspondence, and prove that in the limit as $q\to 0$, we recover a description of the classical Burge correspondence (also known as column RSK) due to Rosso (2012). A key step in the proof is the enumeration of an arbitrary double coset of $\text{GL}_n$ modulo two parabolic subgroups, which we find to be of independent interest. As an application, we use the $q$-Burge correspondence to count isomorphism classes of certain modules over the preprojective algebra of a type $A$ quiver (i.e. a path), refined according to their socle filtrations. This develops a connection between the combinatorics of symmetric functions and the representation theory of preprojective algebras.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Steven N. Karp, Hugh Thomas. 2025-02-10. q-Whittaker functions, finite fields, and Jordan forms. https://doi.org/10.1007/s00029-025-01048-3

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO