Fountains, histograms, and q-identities
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.
Main Authors: | Peter Paule, Helmut Prodinger |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2003-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/336/pdf |
Similar Items
-
q-Enumeration of words by their total variation
by: Ligia Loreta Cristea, et al.
Published: (2011-01-01) -
Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01) -
The location of the first maximum in the first sojourn of a Dyck path
by: Helmut Prodinger
Published: (2008-01-01) -
Asymptotic results for silent elimination
by: Guy Louchard, et al.
Published: (2010-01-01) -
The asymmetric leader election algorithm with Swedish stopping: a probabilistic analysis
by: Guy Louchard, et al.
Published: (2012-09-01)