Two methods for determining combinatorial identities

<p>Two methods are presented for determining advanced combinatorial identities. The first is based on extending the original identity so that it can be expressed in terms of hypergeometric functions whereupon tabulated values of the functions can be used to reduce the identity to a simpler for...

Olles dieđut

Furkejuvvon:
Bibliográfalaš dieđut
Váldodahkki: Victor Kowalenko (Dahkki)
Materiálatiipa: Girji
Almmustuhtton: Annals of Mathematics and Physics - Peertechz Publications, 2023-01-10.
Fáttát:
Liŋkkat:Connect to this object online.
Fáddágilkorat: Lasit fáddágilkoriid
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!

MARC

LEADER 00000 am a22000003u 4500
001 peertech__10_17352_amp_000069
042 |a dc 
100 1 0 |a Victor Kowalenko  |e author 
245 0 0 |a Two methods for determining combinatorial identities 
260 |b Annals of Mathematics and Physics - Peertechz Publications,   |c 2023-01-10. 
520 |a <p>Two methods are presented for determining advanced combinatorial identities. The first is based on extending the original identity so that it can be expressed in terms of hypergeometric functions whereupon tabulated values of the functions can be used to reduce the identity to a simpler form. The second is a computer method based on Koepf's version of the Wilf-Zeilberger approach that has been implemented in a suite of intrinsic routines in Maple. As a consequence, some new identities are presented. </p> 
540 |a Copyright © Victor Kowalenko et al. 
546 |a en 
655 7 |a Research Article  |2 local 
856 4 1 |u https://doi.org/10.17352/amp.000069  |z Connect to this object online.