Combinatorial and automated proofs of certain identities

MaRDI QIDQ547809zbMATH OpenFDO

Authors Justin Brereton, Amelia Farid, Maryam Karnib, Gary R. Marple, Alex Quenon, Akalu Tefera

Publication date 24 June 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/230649, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i2p14.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

combinatorial identitiesgeneratingfunctionologyrecurrence equationsWZZeilberger algorithm

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19)

Review text

Summary: This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enumerative/algebraic combinatorial arguments, modern machineassisted techniques of Wilf-Zeilberger and the classical tools of generatingfunctionology.

Cited in

(7)

• On proofs of certain combinatorial identities
• Combinatorial identities and hypergeometric functions
• Automatic proofs and counterexamples for some ortholattice identities
• Automatic proofs for formulae enumerating proper polycubes
• scientific article; zbMATH DE number 3880787 (Why is no real title available?)
• scientific article; zbMATH DE number 7379066 (Why is no real title available?)
• scientific article; zbMATH DE number 7665843 (Why is no real title available?)

Describes a project that uses

Uses Software

• EKHAD
• SumTools

This page was built for publication: Combinatorial and automated proofs of certain identities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547809)