Combinatorial recurrences and linear difference equations
Rights accessOpen Access
In this work we introduce the triangular arrays of depth greater than 1 given by linear recurrences, that generalize some well known recurrences that appear in enumerative combinatorics. In particular, we focussed on triangular arrays of depth 2, since they are closely related with the solution of linear three–terms recurrences. We show through some simple examples how this triangular arrays appear as essential components in the expression of some classical orthogonal polynomials and combinatorial numbers
CitationJiménez, M.J., Encinas, A. Combinatorial recurrences and linear difference equations. "Electronic notes in discrete mathematics", 17 Octubre 2016, vol. 54, p. 313-318.