Combinatorial and automated proofs of certain identities (Q547809): Difference between revisions
From MaRDI portal
Changed an Item |
Import IPFS CIDs |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreif6iieg7nlfbhxpeunhe3jr7s2fjh5rs2wpxdc4j44kufgjtjnrlq / rank | |||
Normal rank | |||
Latest revision as of 10:23, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial and automated proofs of certain identities |
scientific article |
Statements
Combinatorial and automated proofs of certain identities (English)
0 references
24 June 2011
0 references
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.
0 references
recurrence equations
0 references
combinatorial identities
0 references
Zeilberger algorithm
0 references
WZ
0 references
generatingfunctionology
0 references
