Combinatorial recurrences and linear difference equations
Visualitza/Obre
Cita com:
hdl:2117/90923
Tipus de documentArticle
Data publicació2016-10-17
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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
CitacióJiménez, M.J., Encinas, A. Combinatorial recurrences and linear difference equations. "Electronic notes in discrete mathematics", 17 Octubre 2016, vol. 54, p. 313-318.
ISSN1571-0653
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
combinatorial recurrences.pdf | 108,2Kb | Visualitza/Obre |