English

On the minimal polynomials of the arguments of dilogarithm ladders

Number Theory 2024-12-03 v1

Abstract

Letting Ln(N,u)L_{n}(N, u) denote a polylogarithm ladder of weight nn and index NN with uu 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 uu are permissible in such constructions. Classical relations for the dilogarithm Li2\text{Li}_{2} provide families of weight-2 ladders in such a way so that the base equations for uu consist of a fixed number of terms, and subsequent constructions for dilogarithm ladders rely on sporadic cases whereby uu 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 uu. 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.

Keywords

Cite

@article{arxiv.2412.00991,
  title  = {On the minimal polynomials of the arguments of dilogarithm ladders},
  author = {John M. Campbell},
  journal= {arXiv preprint arXiv:2412.00991},
  year   = {2024}
}

Comments

Submitted for publication