From generating series to polynomial congruences

DOI10.1016/J.JNT.2017.06.007zbMATH Open1423.11016arXiv1703.02322OpenAlexW2592209577MaRDI QIDQ2406366FDOQ2406366

Sandro Mattarei, Roberto Tauraso

Publication date: 27 September 2017

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: Consider an ordinary generating function $su{m}_{k=0}^{infty}{c}_k{x}^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum $su{m}_{k=0}^{q-1}{c}_k{x}^k$, with $q$ a power of a prime $p$, also admits a closed form representation when viewed modulo $p$. Such a representation for the truncated sum modulo $p$ frequently bears a resemblance with the shape of $C(x)$, 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 ${mLi}_d(x)=su{m}_{k=1}^{infty}{x}^k/k^d$, and after supplementing them with some new ones we obtain closed-forms modulo $p$ for the corresponding truncated sums, in terms of finite polylogarithms $pound{s}_d(x)=su{m}_{k=1}^{p-1}{x}^k/k^d$.

Full work available at URL: https://arxiv.org/abs/1703.02322

zbMATH Keywords

generating functionscongruencesbinomial coefficientsharmonic numberspolylogarithms

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Congruences; primitive roots; residue systems (11A07) Binomial coefficients; factorials; (q)-identities (11B65)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hypergeometric functions
• Congruences for central binomial sums and finite polylogarithms
• On poly(ana)logs. I. (With an appendix by Maxim Kontsevich: The \(1\frac{1}{2}\)-logarithm)
• Interesting Series Involving the Central Binomial Coefficient
• Binomial coefficients, Catalan numbers and Lucas quotients
• A combinatorial identity with application to Catalan numbers
• Congruences arising from Apéry-type series for zeta values
• Symmetric Pascal matrices modulo \(p\)

Cited In (10)

• Title not available (Why is that?)
• Supercongruences related to 3F2(1) involving harmonic numbers
• On a congruence involving \(q\)-Catalan numbers
• Congruences concerning generalized central trinomial coefficients
• Congruences for partial sums of the generating series for \(\left( \begin{matrix} 3 k \\ k \end{matrix}\right)\)
• GENERALIZED FINITE POLYLOGARITHMS
• Supercongruences concerning truncated hypergeometric series
• Congruences on sums of super Catalan numbers
• From Madhava–Leibniz to Lehmer’s Limit
• A generalized truncated logarithm

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)