A seventeenth-order polylogarithm ladder
Abstract
Cohen, Lewin and Zagier found four ladders that entail the polylogarithms Lin(α1-k):=Σr>0α1-k r/rn at order n=16, with indices k360, and α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, 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 \ Li17(α1-k)0 k630\ and \π2j(α1)17-2j 0 j8\, 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, which gives the sole Salem number α<1.3 with degree d<12 for which α1/2+α-1/2 fails to be the largest eigenvalue of the adjacency matrix of a graph.
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.