Symbolic summation assists combinatorics.

240 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Some congruences related to a congruence of Van Hamme (2019, methodology): “By using the package Sigma due to Schneider [25], one can automatically discover and prove (4.”
Iterated Binomial Sums and their Associated Iterated Integrals (2014, methodology): “Solve the recurrence (by using Sigma) to get a closed form representation for F (n).”
On Van Hamme's (A.2) and (H.2) supercongruences (2018, methodology): “[7] R. Osburn and C. Schneider, Gaussian hypergeometric series and supercongruences, Math.”
Parameterized Telescoping Proves Algebraic Independence of Sums (2008, unknown): “Since Karr’s summation algorithm [7] and its extensions [20, 23] can solve the parameterized telescoping problem in the difference field setting of ΠΣ∗-fields, we get a rather flexible algorithm which is implemented in the package Sigma [17, 22]: The fi(k) can be arbitrarily nested sums and products”