Rights accessRestricted access - publisher's policy
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 to the solution of linear three–term recurrences. We show through some simple examples how these 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. A: Jornadas de Matemática Discreta y Algorítmica. "Discrete Mathematics Days, Barcelona, 6-8 July 2016". Barcelona: 2016.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org