Indexed metadata

Resultants, Recursive Formulas and Binet Formulas for SU(N)\textrm{SU}(N) Verlinde Sums

Jay Jorgenson, Anders Karlsson, Lejla Smajlović

Source record

Source: arXiv

Published: Sep 28, 2026

arXiv: 2609.36088

Open original source ↗

Source abstract

We study Verlinde sums Vn(N,m)V_{n}(N,m), which for our purposes are finite sums of trigonometric functions {rx}\{r_{x}\}, associated to  SU(N)\textrm{ SU}(N). In this article we prove the following results: (i) the polynomial DN(w):=∏x(w−rx)D_N(w):=\prod_x(w-r_x) is equal to, up to an explicit and computable factor, the iterated resultant of Q(u)=um−1Q(u)=u^m-1 with an explicit elementary polynomial WNW_N which is independent of nn and mm; (ii) for fixed NN and mm, Vn(N,m)V_n(N,m) satisfies a linear recursion of order at most (m−1N−1)\binom{m-1}{N-1}, together with arguments showing that one actually has a recursion of length equal to the number of distinct roots of DND_{N}; (iii) for fixed NN and mm, a Binet-type closed form expressing Vn(N,m)V_n(N,m) as an explicit finite sum of nn-th powers of algebraic numbers which are rescaled reciprocals of the distinct roots of DN(w)D_N(w) is derived. Several explicit examples are provided for N=2,3,4,5,6N=2,3,4,5,6 and 88.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.