Triple Symmetric Sums of Circular Binomial Products

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.

Keywords

• circular sum
• binomial coefficient
• generating function
• recurrence relation