Abstract
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.
Cite
CITATION STYLE
APA
Elbaz-Vincent, P., & Gangl, H. (2015). Finite polylogarithms, their multiple analogues and the shannon entropy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9389, pp. 277–285). Springer Verlag. https://doi.org/10.1007/978-3-319-25040-3_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free