Finite polylogarithms, their multiple analogues and the Shannon entropy - Herbert Gangl, Philippe Elbaz-Vincent
-
last edited by Geo-Sci-InfoAuthor(s): Herbert Gangl, Philippe Elbaz-Vincent
DOI URL: http://dx.doi.org/10.1007/978-3-319-25040-3_31
Video: http://www.youtube.com/watch?v=Pcu3oKN0Xnk
Slides: Elbaz-Vincent_finite polylogarithm.pdf
Presentation: https://www.see.asso.fr/node/14285
Creative Commons Attribution-ShareAlike 4.0 InternationalAbstract:
We show that the entropy function–and hence the finite 1-logarithm–behaves a lot like certain derivations. We recall its cohomological interpretation as a 2-cocycle and also deduce 2n-cocycles for any n. Finally, we give some identities for finite multiple polylogarithms together with number theoretic applications.
