Combinatorial and Automated Proofs of Certain Identities
Abstract
This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enumerative/algebraic combinatorial arguments, modern machine-assisted techniques of Wilf-Zeilberger and the classical tools of generatingfunctionology.
Published
2011-06-18
Article Number
P14