A seventeenth-order polylogarithm ladder

arXivmath/9906134MaRDI QIDQ6501367FDOQ6501367

D. H. Bailey, David J. Broadhurst

Abstract: Cohen, Lewin and Zagier found four ladders that entail the polylogarithms ${mLi}_n(alph{a}_1^{-k}):=su{m}_{r>0}alph{a}_1^{-kr}/r^n$ at order $n=16$, with indices $kle360$, and $alph{a}_1$ being the smallest known Salem number, i.e. the larger real root of Lehmer's celebrated polynomial $alph{a}^{10}+alph{a}^9-alph{a}^7-alph{a}^6-alph{a}^5-alph{a}^4-alph{a}^3+alpha+1$, with the smallest known non-trivial Mahler measure. By adjoining the index $k=630$, we generate a fifth ladder at order 16 and a ladder at order 17 that we presume to be unique. This empirical integer relation, between elements of ${mLi}_{17}(alph{a}_1^{-k})mid0lekle630$ and $p{i}^{2j}(logalph{a}_1{)}^{17-2j}mid0lejle8$, entails 125 constants, multiplied by integers with nearly 300 digits. It has been checked to more than 59,000 decimal digits. Among the ladders that we found in other number fields, the longest has order 13 and index 294. It is based on $alph{a}^{10}-alph{a}^6-alph{a}^5-alph{a}^4+1$, which gives the sole Salem number $alpha<1.3$ with degree $d<12$ for which $alph{a}^{1/2}+alph{a}^{-1/2}$ fails to be the largest eigenvalue of the adjacency matrix of a graph.

This page was built for publication: A seventeenth-order polylogarithm ladder

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6501367)