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

推荐订阅源

D
DataBreaches.Net
F
Fortinet All Blogs
D
Docker
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
WordPress大学
WordPress大学
罗磊的独立博客
Y
Y Combinator Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
J
Java Code Geeks
T
The Blog of Author Tim Ferriss
U
Unit 42
N
Netflix TechBlog - Medium
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
V
V2EX
云风的 BLOG
云风的 BLOG
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
T
Tailwind CSS Blog
Hugging Face - Blog
Hugging Face - Blog
Stack Overflow Blog
Stack Overflow Blog
爱范儿
爱范儿
酷 壳 – CoolShell
酷 壳 – CoolShell
P
Proofpoint News Feed
G
Google Developers Blog
H
Help Net Security

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}}$
AHA! RSK
Eugene Stern · 2026-05-30 · via math.CO updates on arXiv.org

We give a spectral realization of the Robinson-Schensted-Knuth (RSK) correspondence in terms of the representation theory of the symmetric group $S_n$ and the degenerate affine Hecke algebra (AHA) $H_n$. We view RSK, which builds a pair of standard Young tableaux from a permutation, as a special case of rectification, also known as Jeu de Taquin, which turns skew tableaux into straight ones. In this framing, the initial permutation corresponds to a skew tableau of staircase shape. To interpret this in terms of representation theory, take permutations to label weight vectors in a generic $H_n$-module $V(a_1, \ldots , a_n)$, which is isomorphic to $\mathbb{C}[S_n]$ as an $S_n$-module. Writing permutations as staircases amounts to placing these weight vectors inside the regular representation of a larger symmetric group containing $S_n$; more geometrically, we push $S_n$ to the right toward infinity so its Jucys-Murphy (JM) elements have enough room to represent the external translations of $H_n$. Then, rectification corresponds to squeezing out this extra room from the left, leaving only $S_n$ and its regular JM elements as the limit of the external translations. By expressing slides via sequences of exchanges of consecutive values inside the tableau, we can model rectification by an operator acting on the regular representation. This lets us explicitly write down the change of basis between $H_n$-weight vectors and $S_n$-weight vectors, where the latter are eigenvectors of the JM elements in $S_n$ acting both on the left and on the right, and hence labeled by pairs of standard tableaux. The resulting correspondence between the labels of the weight vectors is exactly RSK.