English

Congruences Related to Dual Sequences and Catalan Numbers

Combinatorics 2020-10-26 v2

Abstract

During the study of dual sequences, Sun introduced the polynomials Dn(x,y)=k=0n(nk)(xk)yk and Sn(x,y)=k=0n(nk)(xk)(1xk)yk. D_n(x,y)=\sum_{k=0}^{n}{n\choose k}{x\choose k}y^k\text{ and } S_n(x,y)=\sum_{k=0}^{n}\binom{n}{k}\binom{x}{k}\binom{-1-x}{k} y^k. Many related congruences have been established and conjectured by Sun. Here we generalize some of them by determining k=0p1Dk(x1,y1)Dk(x2,y2)(modp) and k=0p1Sk(x1,y1)Sk(x2,y2)(modp) \sum_{k=0}^{p-1}D_k(x_1,y_1)D_k(x_2,y_2)\pmod p \text{ and } \sum_{k=0}^{p-1}S_k(x_1,y_1)S_k(x_2,y_2)\pmod p for any odd prime pp and pp-adic integers xi, yix_i,\ y_i with i{1,2}i\in\{1,2\}. Considering the immediate connection between binomial coefficients and Catalan numbers, we also characterize n=0p1(k=0n(nk)Ckak)2(modp), \sum_{n=0}^{p-1}\left(\sum_{k=0}^n {n \choose k} \frac{C_k}{a^k}\right)^2 \pmod {p}, where CkC_k denotes the kkth Catalan number, aZ{0}a\in\mathbb{Z}\setminus \{0\} with gcd(a,p)=1\gcd(a,p)=1. These confirm and generalise some of Sun's conjectures.

Keywords

Cite

@article{arxiv.2010.04439,
  title  = {Congruences Related to Dual Sequences and Catalan Numbers},
  author = {Rong-Hua Wang and Michael X. X. Zhong},
  journal= {arXiv preprint arXiv:2010.04439},
  year   = {2020}
}

Comments

12 pages

R2 v1 2026-06-23T19:12:05.255Z