Combinatorial and Automated Proofs of Certain Identities

Author(s)
Brereton, Justin; Farid, Amelia; Karnib, Maryam; Marple, Gary; Quenon, Alex; ... Show more
Thumbnail
DownloadBrereton-2011-Combinatorial and automated.pdf (126.9Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
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.
Date issued
2011-06
URI
http://hdl.handle.net/1721.1/89797
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Electronic Journal of Combinatorics
Publisher
Electronic Journal of Combinatorics
Citation
Brereton, Justin, Amelia Farid, Maryam Karnib, Gary Marple, Alex Quenon, and Akula Tefera. "Combinatorial and Automated Proofs of Certain Identities." Electronic Journal of Combinatorics, Volume 18, Issue 2 (2011-2).
Version: Final published version
ISSN
1077-8926
Collections