Combinatorial and Automated Proofs of Certain Identities

Combinatorial and Automated Proofs of Certain Identities

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.

Bibliographic Details
Main Authors: Brereton, Justin (Contributor), Farid, Amelia (Author), Karnib, Maryam (Author), Marple, Gary (Author), Quenon, Alex (Author), Tefera, Akula (Author)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Electronic Journal of Combinatorics, 2014-09-18T15:19:54Z.
Subjects:
Article
Online Access:Get fulltext

Similar Items

Similar Items