Peter Paule ; Helmut Prodinger - Fountains, histograms, and q-identities

dmtcs:336 - Discrete Mathematics & Theoretical Computer Science, January 1, 2003, Vol. 6 no. 1 -
Fountains, histograms, and q-identitiesArticle

Authors: Peter Paule 1; Helmut Prodinger 2

  • 1 Research Institute for Symbolic Computation
  • 2 The John Knopfmacher Centre for Applicable Analysis and Number Theory [Johannesburg]

We solve the recursion S_n=S_n-1-q^nS_n-p, both, explicitly, and in the limit for n→∞, proving in this way a formula due to Merlini and Sprugnoli. It is also discussed how computer algebra could be applied.

Volume: Vol. 6 no. 1
Published on: January 1, 2003
Imported on: March 26, 2015
Keywords: q―identities,fountains,histograms,Schur polynomials,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

1 Document citing this article

Consultation statistics

This page has been seen 242 times.
This article's PDF has been downloaded 236 times.