Abstract
By employing the generating function approach, 16 triple sums for circular binomial products of binomial coefficients are examined. Recurrence relations and generating functions are explicitly determined. These symmetric sums may find potential applications in the analysis of algorithms, symbolic calculus, and computations in theoretical physics.
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call