arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0006051math.NTmath.KT
收藏

有限和p-adic多项式

Finite and p-adic polylogarithms

Amnon Besser

摘要:

Z/p [z]中的有限n次重对数li_n(z)定义为z ^k/k ^n在k上从1到p-1的和。我们陈述并证明了下面的定理。设Li_k:C_p到C_p是Coleman定义的p-adic多项式。则系数与p无关的多项式与多项式乘积的线性组合F_n具有p ^{1-n} DF_n(z ^p)模p> n +1约化为li_{n-1}(z)的性质,其中D是Cathelineau算子z(1-z)d/dz.这个定理的一个稍微修改的版本是由Kontsevich证明的。这个定理被Elbaz-Vincent和Gangl用来从复多项式的函数方程推导出有限多项式的函数方程。

英文摘要:

The finite n-th polylogarithm li_n(z) in Z/p[z] is defined as the sum on k from 1 to p-1 of z^k/k^n. We state and prove the following theorem. Let Li_k:C_p to C_p be the p-adic polylogarithms defined by Coleman. Then a certain linear combination F_n of products of polylogarithms and logarithms, with coefficients which are independent of p, has the property that p^{1-n} DF_n(z^p) reduces modulo p>n+1 to li_{n-1}(z) where D is the Cathelineau operator z(1-z) d/dz. 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑