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
_version_ 1826211897713623040
author Brereton, Justin
Farid, Amelia
Karnib, Maryam
Marple, Gary
Quenon, Alex
Tefera, Akula
author2 Massachusetts Institute of Technology. Department of Mathematics
author_facet Massachusetts Institute of Technology. Department of Mathematics
Brereton, Justin
Farid, Amelia
Karnib, Maryam
Marple, Gary
Quenon, Alex
Tefera, Akula
author_sort Brereton, Justin
collection MIT
description 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.
first_indexed 2024-09-23T15:13:10Z
format Article
id mit-1721.1/89797
institution Massachusetts Institute of Technology
language en_US
last_indexed 2024-09-23T15:13:10Z
publishDate 2014
publisher Electronic Journal of Combinatorics
record_format dspace
spelling mit-1721.1/897972022-10-02T01:24:54Z Combinatorial and Automated Proofs of Certain Identities Brereton, Justin Farid, Amelia Karnib, Maryam Marple, Gary Quenon, Alex Tefera, Akula Massachusetts Institute of Technology. Department of Mathematics Brereton, Justin 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. United States. National Security Agency (Grant H98230-10-1-0222) 2014-09-18T15:19:54Z 2014-09-18T15:19:54Z 2011-06 2011-04 Article http://purl.org/eprint/type/JournalArticle 1077-8926 http://hdl.handle.net/1721.1/89797 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). en_US http://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i2p14 Electronic Journal of Combinatorics 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. application/pdf Electronic Journal of Combinatorics Electronic Journal of Combinatorics
spellingShingle Brereton, Justin
Farid, Amelia
Karnib, Maryam
Marple, Gary
Quenon, Alex
Tefera, Akula
Combinatorial and Automated Proofs of Certain Identities
title Combinatorial and Automated Proofs of Certain Identities
title_full Combinatorial and Automated Proofs of Certain Identities
title_fullStr Combinatorial and Automated Proofs of Certain Identities
title_full_unstemmed Combinatorial and Automated Proofs of Certain Identities
title_short Combinatorial and Automated Proofs of Certain Identities
title_sort combinatorial and automated proofs of certain identities
url http://hdl.handle.net/1721.1/89797
work_keys_str_mv AT breretonjustin combinatorialandautomatedproofsofcertainidentities
AT faridamelia combinatorialandautomatedproofsofcertainidentities
AT karnibmaryam combinatorialandautomatedproofsofcertainidentities
AT marplegary combinatorialandautomatedproofsofcertainidentities
AT quenonalex combinatorialandautomatedproofsofcertainidentities
AT teferaakula combinatorialandautomatedproofsofcertainidentities