On the minimal polynomials of the arguments of dilogarithm ladders

Abstract

Letting Ln(N, u) denote a polylogarithm ladder of weight n and index N with u as an algebraic number, there is a rich history surrounding how mathematical objects of this form can be constructed for a given weight or index. This raises questions as to what minimal polynomials for u are permissible in such constructions. Classical relations for the dilogarithm Li2 provide families of weight-2 ladders in such a way so that the base equations for u consist of a fixed number of terms, and subsequent constructions for dilogarithm ladders rely on sporadic cases whereby u is defined via a cyclotomic equation, as in the supernumary ladders due to Abouzahra and Lewin. This motivates our construction of an infinite family of dilogarithm ladders so as to obtain arbitrarily many terms with nonzero coefficients for the minimal polynomials for u. Our construction relies on a derivation of a dilogarithm identity introduced by Khoi in 2014 via the Seifert volumes of manifolds obtained from the use of Dehn surgery.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…