Resultants, Recursive Formulas and Binet Formulas for Verlinde Sums
Jay Jorgenson, Anders Karlsson, Lejla Smajlović
Source abstract
We study Verlinde sums , which for our purposes are finite sums of trigonometric functions , associated to . In this article we prove the following results: (i) the polynomial is equal to, up to an explicit and computable factor, the iterated resultant of with an explicit elementary polynomial which is independent of and ; (ii) for fixed and , satisfies a linear recursion of order at most , together with arguments showing that one actually has a recursion of length equal to the number of distinct roots of ; (iii) for fixed and , a Binet-type closed form expressing as an explicit finite sum of -th powers of algebraic numbers which are rescaled reciprocals of the distinct roots of is derived. Several explicit examples are provided for and .
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.