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, Farid, Amelia, Karnib, Maryam, Marple, Gary, Quenon, Alex, Tefera, Akula
Other Authors: Massachusetts Institute of Technology. Department of Mathematics
Format: Article
Language:en_US
Published: Electronic Journal of Combinatorics 2014
Online Access:http://hdl.handle.net/1721.1/89797

Internet

http://hdl.handle.net/1721.1/89797

Similar Items