Fountains, histograms, and q-identities
We solve the recursion S-n = Sn-1- q(n)S(n- p), both, explicitly, and in the limit for n --> infinity, proving in this way a formula due to Merlini and Sprugnoli. It is also discussed how computer algebra could be applied.
fountains histograms q-identities schur polynomials