Combinatorial and Automated Proofs of Certain Identities
Name
Brereton-2011-Combinatorial and automated.pdf
Size
126.91 KB
Format
Adobe PDF
Checksum (MD5)
25ad061fd747d2956685326a166b4f72
Author(s)
Brereton, Justin
Farid, Amelia
Karnib, Maryam
Marple, Gary
Quenon, Alex
Tefera, Akula
Date Issued
June 2011
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.37236/2010
