Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-25T04:22:03.401Z Has data issue: false hasContentIssue false

Finite and p-adic Polylogarithms

Published online by Cambridge University Press:  04 December 2007

Amnon Besser
Affiliation:
Department of Mathematics, Ben-Gurion University of the Negev, PO Box 84105, Beer-Sheva, Israel. E-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The finite nth polylogarithm lin(z) ∈ Z/p(z) is defined as [sum ]k=1p−1zk/kn. We state and prove the following theorem. Let Lik: $ C$p$ C$p be the p-adic polylogarithms defined by Coleman. Then a certain linear combination Fn of products of polylogarithms and logarithms, with coefficients which are independent of p, has the property that p1−nDFn(z) reduces modulo p>n+1 to lin−1(σ(z)), where D is the Cathelineau operator z(1−z)d/dz and σ is the inverse of the p-power map. A slightly modified version of this theorem was conjectured by Kontsevich. This theorem is used by Elbaz-Vincent and Gangl to deduce functional equations of finite polylogarithms from those of complex polylogarithms.

Type
Research Article
Copyright
© 2002 Kluwer Academic Publishers