From generating series to polynomial congruences

From MaRDI portal
Publication:2406366




Abstract: Consider an ordinary generating function sumk=0inftyckxk, 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 sumk=0q1ckxk, 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 mLid(x)=sumk=1inftyxk/kd, and after supplementing them with some new ones we obtain closed-forms modulo p for the corresponding truncated sums, in terms of finite polylogarithms poundsd(x)=sumk=1p1xk/kd.









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)