Combinatorial and Automated Proofs of Certain Identities

  • Justin Brereton
  • Amelia Farid
  • Maryam Karnib
  • Gary Marple
  • Alex Quenon
  • Akalu Tefera
DOI: https://doi.org/10.37236/2010

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.

Published
2011-06-18
How to Cite
Brereton, J., Farid, A., Karnib, M., Marple, G., Quenon, A., & Tefera, A. (2011). Combinatorial and Automated Proofs of Certain Identities. The Electronic Journal of Combinatorics, 18(2), P14. https://doi.org/10.37236/2010
Issue
Volume 18, Issue 2 (2011-2) (The Zeilberger Festschrift volume)
Article Number
P14