Automated discovery and proof of congruence theorems for partial sums of combinatorial sequences
From MaRDI portal
Publication:2816619
DOI10.1080/10236198.2016.1142541zbMath1368.11020arXiv1509.09070OpenAlexW2173952281MaRDI QIDQ2816619
Qing-Hu Hou, William Y. C. Chen, Doron Zeilberger
Publication date: 25 August 2016
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.09070
Symbolic computation and algebraic computation (68W30) Combinatorial identities, bijective combinatorics (05A19) Other combinatorial number theory (11B75)
Related Items (7)
Elementary proof of congruences involving sum of binomial coefficients ⋮ Constant term evaluation and two kinds of congruence ⋮ Using the “Freshman′s Dream” to Prove Combinatorial Congruences ⋮ The research and progress of the enumeration of lattice paths ⋮ On two conjectural supercongruences of Apagodu and Zeilberger ⋮ How to Generate All Possible Rational Wilf-Zeilberger Pairs? ⋮ CTcong.txt
Cites Work
- Congruences involving generalized central trinomial coefficients
- Factoring polynomials with rational coefficients
- Another congruence for the Apéry numbers
- A combinatorial identity with application to Catalan numbers
- A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences
This page was built for publication: Automated discovery and proof of congruence theorems for partial sums of combinatorial sequences
