Finite polylogarithms, their multiple analogues and the Shannon entropy

DOI10.1007/978-3-319-25040-3_31zbMATH Open1396.94047OpenAlexW4365460979MaRDI QIDQ2807526FDOQ2807526

Authors: Philippe Elbaz-Vincent, Herbert Gangl 

Publication date: 25 May 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25040-3_31

Recommendations

• Entropy modulo a prime
• New functional equations of finite multiple polylogarithms
• Finite and \(p\)-adic polylogarithms
• On poly(ana)logs. I. (With an appendix by Maxim Kontsevich: The \(1\frac{1}{2}\)-logarithm)
• A characterization of generalized multinomial coefficients related to the entropic chain rule

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Higher logarithm functions (33B30) Geometric class field theory (11G45)

Cited In (3)

• Orders of growth of Shannon functions for circuit complexity over infinite bases
• Shannon entropy of symmetric Pollaczek polynomials
• A characterization of generalized multinomial coefficients related to the entropic chain rule

This page was built for publication: Finite polylogarithms, their multiple analogues and the Shannon entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807526)