Discrete Mathematics & Theoretical Computer Science, Vol 6, No 1 (2003)

Font Size:  Small  Medium  Large
DMTCS vol 6 no 1 (2003), pp. 101-106

Discrete Mathematics & Theoretical Computer Science


Volume 6 n° 1 (2003), pp. 101-106

author:Peter Paule and Helmut Prodinger
title:Fountains, histograms, and q-identities
keywords:q-identities, fountains, histograms, Schur polynomials
abstract:We solve the recursion Sn=S_{n-1}-qnS_{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.

If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files.

reference: Peter Paule and Helmut Prodinger (2003), Fountains, histograms, and q-identities, Discrete Mathematics and Theoretical Computer Science 6, pp. 101-106
bibtex:For a corresponding BibTeX entry, please consider our BibTeX-file.
ps.gz-source:dm060108.ps.gz (33 K)
ps-source:dm060108.ps (86 K)
pdf-source:dm060108.pdf (49 K)

The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.

Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.

Automatically produced on Wed Aug 27 14:24:41 CEST 2003 by falk