Combinatorial and automated proofs of certain identities
Summary: This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enumerative/algebraic combinatorial arguments, modern machineassisted techniques of Wilf-Zeilberger and the classical tools of generatingfunctionology.
scientific article; zbMATH DE number 5913198