From generating series to polynomial congruences
From MaRDI portal
Publication:2406366
Abstract: Consider an ordinary generating function , of an integer sequence of some combinatorial relevance, and assume that it admits a closed form . Various instances are known where the corresponding truncated sum , with a power of a prime , also admits a closed form representation when viewed modulo . Such a representation for the truncated sum modulo frequently bears a resemblance with the shape of , despite being typically proved through independent arguments. One of the simplest examples is the congruence being a finite match for the well-known generating function . We develop a method which allows one to directly infer the closed-form representation of the truncated sum from the closed form of the series for a significant class of series involving central binomial coefficients. In particular, we collect various known such series whose closed-form representation involves polylogarithms , and after supplementing them with some new ones we obtain closed-forms modulo for the corresponding truncated sums, in terms of finite polylogarithms .
Recommendations
- Congruences for central binomial sums and finite polylogarithms
- Congruences of finite summations of the coefficients in certain generating functions
- Congruences concerning generalized central trinomial coefficients
- On sums related to central binomial and trinomial coefficients
- Supercongruences for a truncated hypergeometric series
Cites work
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 6600943 (Why is no real title available?)
- A combinatorial identity with application to Catalan numbers
- Binomial coefficients, Catalan numbers and Lucas quotients
- Congruences arising from Apéry-type series for zeta values
- Congruences for central binomial sums and finite polylogarithms
- Generatingfunctionology
- Hypergeometric functions
- Interesting Series Involving the Central Binomial Coefficient
- On poly(ana)logs. I. (With an appendix by Maxim Kontsevich: The \(1\frac{1}{2}\)-logarithm)
- Series with central binomial coefficients, Catalan numbers, and harmonic numbers
- Symmetric Pascal matrices modulo \(p\)
Cited in
(12)- From Madhava-Leibniz to Lehmer's limit
- Supercongruences concerning truncated hypergeometric series
- Congruences for central binomial sums and finite polylogarithms
- Congruences for partial sums of the generating series for \(\left( \begin{matrix} 3 k \\ k \end{matrix}\right)\)
- Congruences on sums of super Catalan numbers
- More congruences for central binomial sums with Fibonacci and Lucas numbers
- Congruences of finite summations of the coefficients in certain generating functions
- Congruences concerning generalized central trinomial coefficients
- Generalized finite polylogarithms
- A generalized truncated logarithm
- Supercongruences related to 3F2(1) involving harmonic numbers
- On a congruence involving \(q\)-Catalan numbers
This page was built for publication: From generating series to polynomial congruences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2406366)