Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Fountains, histogram ...
Article

Fountains, histograms, and q-identities

Peter Paule (1), Helmut Prodinger (2)
(1) Research Institute for Symbolic Computation
(2) The John Knopfmacher Centre for Applicable Analysis and Number Theory [Johannesburg]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2003
Last modified on
March 31, 2025
Volume 6
vol. 6:1
DOI
10.46298/dmtcs.336
License
https://about.hal.science/hal-authorisation-v1
Indicators
567
Views
574
Downloads

Fountains, histograms, and q-identities

Peter Paule (1), Helmut Prodinger (2)
(1) Research Institute for Symbolic Computation
(2) The John Knopfmacher Centre for Applicable Analysis and Number Theory [Johannesburg]
Abstract
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • q―identities
  • fountains
  • histograms
  • Schur polynomials
Cited by

Source: OpenCitations

  • Some combinatorial matrices and their LU-decomposition

    Special Matrices

    Authors : Helmut Prodinger ORCID

    Journal reference : Volume 8, 2020, pp. 61-67

    DOI : 10.1515/spma-2020-0007
Preview
Loading PDF preview...