On the Combinatorial Core of Second-Order Quantum Argument Shifts in Ugld
Abstract
We provide a complete, self-contained proof that reduces second-order generators of the quantum argument-shift algebra in the universal enveloping algebra Ugld. We prove the necessary combinatorial identities -- expressed as relations among polynomials with rational coefficients -- by induction.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.