Generalized Mneimneh sums and their application to multiple polylogarithms
From MaRDI portal
Publication:6646432
DOI10.1016/j.disc.2024.114318MaRDI QIDQ6646432
Publication date: 2 December 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65) Higher logarithm functions (33B30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computer proofs of a new family of harmonic number identities.
- Theory and application of infinite series.
- Note on the series \(\sum_{n=1}^\infty \frac{x^n}{n^s}\).
- Identities for generalized polylogarithms
- A binomial sum of harmonic numbers
- Combinatorial sums and finite differences
- Multiple Zeta Functions, Multiple Polylogarithms and Their Special Values
- Special values of multiple polylogarithms
- The Art of Proving Binomial Identities
- Applications of derivative and difference operators on some sequences
- Feynman Integrals
- Applications of Zeilberger’s Algorithm to Ramanujan-Inspired Series Involving Harmonic-Type Numbers
- On Mneimneh's binomial sum involving harmonic numbers
- A generalization of Mneimneh's binomial sum of harmonic numbers
This page was built for publication: Generalized Mneimneh sums and their application to multiple polylogarithms