9 research outputs found
Symmetric Pascal matrices modulo p
We study characteristic polynomials of symmetric matrices with entries
the binomial coefficients, over finite fields.Comment: 16 pages, added reference, changes in presentation, correction of an
error in a proo
From generating series to polynomial congruences
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
Symmetric Pascal matrices modulo p
This paper deals with symmetric matrices associated to Pascal's triangle. More precisely, we consider the matrix P (n) with coecients ; 0 i; j < n : We call P (n) the symmetric Pascal matrix of order n. An easy computation yields P (1) = T T where T is the in nite unipotent lower triangular matrix T = B B B B B B 1 1 1 2 1 1 3 3 1 . . . .