Automated proofs for some stirling number identities

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We present computer-generated proofs for some summation identities for (q-)Stirling and (q-)Eulerian numbers that were obtained by combining a recent summation algorithm for Stirling number identities with a recurrence solver for difference fields.

Cite

CITATION STYLE

APA

Kauers, M., & Schneider, C. (2008). Automated proofs for some stirling number identities. Electronic Journal of Combinatorics, 15(1 R). https://doi.org/10.37236/726

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free