惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

WordPress大学
WordPress大学
J
Java Code Geeks
Martin Fowler
Martin Fowler
Microsoft Azure Blog
Microsoft Azure Blog
月光博客
月光博客
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
人人都是产品经理
人人都是产品经理
有赞技术团队
有赞技术团队
爱范儿
爱范儿
Engineering at Meta
Engineering at Meta
GbyAI
GbyAI
博客园 - 【当耐特】
Y
Y Combinator Blog
Last Week in AI
Last Week in AI
MongoDB | Blog
MongoDB | Blog
G
Google Developers Blog
博客园 - 三生石上(FineUI控件)
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
大猫的无限游戏
大猫的无限游戏
罗磊的独立博客
The Cloudflare Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
V
V2EX
博客园 - 司徒正美

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
q-Whittaker functions, finite fields, and Jordan forms
Steven N. Karp, Hugh Thomas · 2022-07-26 · via math.CO updates on arXiv.org

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.