Amanote Research

Amanote Research

    RegisterSign In

Finite Polylogarithms, Their Multiple Analogues and the Shannon Entropy

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-25040-3_31
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2015

Authors
Philippe Elbaz-VincentHerbert Gangl
Publisher

Springer International Publishing


Related search

On Finite Carlitz Multiple Polylogarithms

Journal de Theorie des Nombres de Bordeaux
Number TheoryAlgebra
2017English

The Multiple Summation Formula and Polylogarithms

Mathematica Moravica
2005English

The Shannon Entropy of Sudoku Matrices

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
MathematicsEngineeringAstronomyPhysics
2010English

Shannon Entropy: Axiomatic Characterization and Application

International Journal of Mathematics and Mathematical Sciences
Mathematics
2005English

Shannon Entropy Analysis of the Genome Code

Mathematical Problems in Engineering
MathematicsEngineering
2012English

Shearer’s Inequality and Infimum Rule for Shannon Entropy and Topological Entropy

Contemporary Mathematics
Mathematics
2016English

Multiple Polylogarithms: An Introduction

2002English

Generalized Multiple Dirichlet Series and Generalized Multiple Polylogarithms

Acta Arithmetica
Number TheoryAlgebra
2006English

Mining Frequent Patterns of Crime Using FP-Growth With Multiple Minimum Supports Based on Shannon Entropy

International Journal of Computer Applications
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy