| | |
| | |
Stat |
Members: 3645 Articles: 2'506'133 Articles rated: 2609
26 April 2024 |
|
| | | |
|
Article overview
| |
|
From generating series to polynomial congruences | Sandro Mattarei
; Roberto Tauraso
; | Date: |
7 Mar 2017 | Abstract: | Consider an ordinary generating function $sum_{k=0}^{infty}c_kx^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 $sum_{k=0}^{q-1}c_kx^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
$sum_{k=0}^{q-1}inom{2k}{k}x^kequiv(1-4x)^{(q-1)/2}pmod{p}$ being a finite
match for the well-known generating function
$sum_{k=0}^inftyinom{2k}{k}x^k= 1/sqrt{1-4x}$. 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
${
m Li}_d(x)=sum_{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 $pounds_d(x)=sum_{k=1}^{p-1}x^k/k^d$. | Source: | arXiv, 1703.2322 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |