Algebraic Combinatorics and Computer Science pp 461-472 | Cite as

# Solving linear recurrences using functionals

## Abstract

Many counting problems (especially those related to lattice path counting) give rise to recurrence relations. Several techniques are available for solving recurrence relations (see, e.g., [3]). A technique not mentioned in [3] is the umbral calculus. The main contribution in this respect is due to Niederhausen [4, 5, 6, 7, 8, 9, 10]. Niederhausen finds polynomial solutions to recurrence relations. In fact, if we have a recurrence relation in two variables, then his approach interprets one variable as the index of a polynomial sequence and the other variable as the argument of a polynomial. Moreover, he assumes that the solutions can be represented as so-called Sheffer sequences (for definitions, see Sect. 2). This assumption is true for a large class of recurrences. The umbral calculus provides several explicit formulas for calculations with these Sheffer sequences. These formulas are expressed in terms of linear operators on the vector space of polynomials. The recurrence relation is then translated into an equation involving the so-called delta operator of the Sheffer sequence. If this equation can be solved explicitly, then the basic sequence can be calculated by the transfer formula from umbral calculus (which, in some sense, is equivalent to Lagrange inversion). The deep part of the work of Niederhausen is that he has extended this basic scheme to allow for certain classes of initial values (see references mentioned above). Related to the work of Niederhausen are two papers by Watanabe [18, 19]. In particular, [18] contains a multivariate extension of the Niederhausen approach in case of the ballot problem.

## Keywords

Recurrence Relation Formal Power Series Lattice Path Linear Recurrence Substitution Rule## Preview

Unable to display preview. Download preview PDF.

## References

- [1]Di Bucchianico, A. (1997): Probabilistic and analytical aspects of the umbral calculus. (CWI Tract., vol. 119). Centrum voor Wiskunde en Informatica, AmsterdamMATHGoogle Scholar
- [2]Di Bucchianico, A., Loeb, D.E. (1998): Natural exponential families and umbral calculus. In: Sagan, B., Stanley, R.P. (eds.) Mathematical Essays in Honor of Gian-Carlo Rota. Birkhäuser Boston, Boston, MA, pp. 43–60Google Scholar
- [3]Mohanty, S.G. (1979): Lattice path counting and applications. Academic Press, New YorkMATHGoogle Scholar
- [4]Niederhausen, H. (1979): Lattice paths with three step directions. Congr. Numer.
**24**, 753–774MathSciNetGoogle Scholar - [5]Niederhausen, H. (1980): Linear recurrences under side conditions. European J. Combin.
**1**, 353–368MathSciNetMATHGoogle Scholar - [6]Niederhausen, H. (1980): Sheffer polynomials and linear recurrences. Congr. Numer.
**29**, 689–698MathSciNetGoogle Scholar - [7]Niederhausen, H. (1985): A formula for explicit solutions of certain linear recursions on polynomial sequences. Congr. Numer.
**49**, 87–98MathSciNetGoogle Scholar - [8]Niederhausen, H. (1996): Symmetric Sheffer sequences and their applications to lattice path counting. J. Statist. Plann. Inference
**54**, 87–100MathSciNetMATHCrossRefGoogle Scholar - [9]Niederhausen, H. (1997); Lattice path enumeration and umbral calculus. In: Balakrishnan, N. (ed.) Advances in Combinatorial Methods and Applications to Probability and Statistics. Birkhäuser Boston, Boston, MA, pp. 87–100Google Scholar
- [10]Niederhausen, H. (1999): Recursive initial value problems for Sheffer sequences. Discrete Math.
**204**, 319–327MathSciNetMATHCrossRefGoogle Scholar - [11]Niven, I. (1969): Formal power series. Amer. Math. Monthly
**76**, 871–889MathSciNetMATHCrossRefGoogle Scholar - [12]Razpet, M. (1990): An application of the umbral calculus. J.Math. Anal. Appl.
**149**, 1–16MathSciNetMATHCrossRefGoogle Scholar - [13]Razpet, M. (1990): A new class of polynomials with applications. J. Math. Anal. Appl.
**150**, 85–99MathSciNetMATHCrossRefGoogle Scholar - [14]Roman, S.M. (1979): The algebra of formal series. III. Several variables. J. Approx. Theory
**26**, 340–381MathSciNetMATHCrossRefGoogle Scholar - [15]Roman, S.M. (1984): The umbral calculus. Academic Press, New YorkMATHGoogle Scholar
- [16]Roman, S.M., De Land, P.N., Shiflett, R.C., Schultz, H.S. (1983): The umbral calculus and the solution to certain recurrence relations. J. Combin. Inform. System Sci.
**8**, 235–240MathSciNetMATHGoogle Scholar - [17]Soto y Koelemeijer, G. (1998): Recurrences and umbral calculus. Master’s thesis, Delft University of TechnologyGoogle Scholar
- [18]Watanabe, T. (1986): On a generalization of polynomials in the ballot problem. J. Statist. Plann. Inference
**14**, 143–152MathSciNetMATHCrossRefGoogle Scholar - [19]Watanabe, T. (1987): On a determinant sequence in the lattice path counting. J. Math. Anal. Appl.
**123**, 401–414MathSciNetMATHCrossRefGoogle Scholar