Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rogers--Ramanujan identities from the geometry of Xa=YbX^a=Y^b

Published 17 Sep 2026 in math.NT, math.AG, math.CO, and math.RT | (2609.20567v1)

Abstract: We prove the conjecture of Huang, Jiang, and Oblomkov (HJO) giving a geometric extension of the Rogers--Ramanujan and Andrews--Gordon identities for every torus-knot singularity X<sup>a=Y<sup>bX<sup>a=Y<sup>b with coprime $1<a<b.$ For a prime power qq, let NC<em>n<sup>a,b(</sup>Fq)\mathcal{NC}<em>n<sup>{a,b}(\mathbb</sup> F_q) denote the set of pairs of commuting nilpotent n×nn\times n matrices (A,B)(A,B) over Fq\mathbb F_q satisfying A<sup>a=B<sup>bA<sup>a=B<sup>b. We establish the threefold equality between their normalized counts, the HJO qq-series Z</em>a,bZ</em>{a,b}, and the explicit infinite product Pa,bP_{a,b}: [ \underbrace{\vphantom{\Bigg|} \prod_{m\geq1}(1-q{-m}) \Biggl(\sum_{n=0}{\infty} \frac{\lvert\mathcal{NC}n{a,b}(\mathbb F_q)\rvert} {\lvert\operatorname{GL}_n(\mathbb F_q)\rvert}\Biggr) }{\text{point count}} = \underbrace{\vphantom{\Bigg|}Z_{a,b}(q{-1}) }{\text{(q)-series}} = \underbrace{\vphantom{\Bigg|}P{a,b}(q{-1}) }_{\text{infinite product}}. ] Our main result is a stronger finite identity: the rank NN HJO sum equals (q;q)N(q;q)_N times the generating function for balanced cylindric partitions with entries bounded by NN. Taking N→∞N\to\infty yields the HJO conjecture. The proof combines the compositional rational shuffle theorem of Bergeron--Garsia--Leven--Xin and Mellit with a multiplicativity theorem for slope operators and a determinantal model for bounded cylindric partitions, linked by a common qq-difference equation. The finite identity and the HJO conjecture have been formalized in Lean by AxiomProver, conditional on two stated literature inputs.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.