English

A seventeenth-order polylogarithm ladder

Classical Analysis and ODEs 2025-10-20 v1 Numerical Analysis Numerical Analysis Number Theory

Abstract

Cohen, Lewin and Zagier found four ladders that entail the polylogarithms Lin(α1k):=r>0α1kr/rn{\rm Li}_n(\alpha_1^{-k}):=\sum_{r>0}\alpha_1^{-k r}/r^n at order n=16n=16, with indices k360k\le360, and α1\alpha_1 being the smallest known Salem number, i.e. the larger real root of Lehmer's celebrated polynomial α10+α9α7α6α5α4α3+α+1\alpha^{10}+\alpha^9-\alpha^7-\alpha^6-\alpha^5-\alpha^4-\alpha^3+\alpha+1, with the smallest known non-trivial Mahler measure. By adjoining the index k=630k=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 {Li17(α1k)0k630}\{{\rm Li}_{17}(\alpha_1^{-k})\mid0\le k\le630\} and {π2j(logα1)172j0j8}\{\pi^{2j}(\log\alpha_1)^{17-2j}\mid 0\le j\le8\}, 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 α10α6α5α4+1\alpha^{10}-\alpha^6-\alpha^5-\alpha^4+1, which gives the sole Salem number α<1.3\alpha<1.3 with degree d<12d<12 for which α1/2+α1/2\alpha^{1/2}+\alpha^{-1/2} fails to be the largest eigenvalue of the adjacency matrix of a graph.

Cite

@article{arxiv.math/9906134,
  title  = {A seventeenth-order polylogarithm ladder},
  author = {David H. Bailey and David J. Broadhurst},
  journal= {arXiv preprint arXiv:math/9906134},
  year   = {2025}
}

Comments

18 pages, LaTeX