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.
| Main Authors: | , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Electronic Journal of Combinatorics,
2014-09-18T15:19:54Z.
|
| Subjects: | |
| Online Access: | Get fulltext |