Triangular sequences, combinatorial recurrences and linear difference equations

Autor: María José Jiménez Jiménez, Andrés M. Encinas

Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

In this work we introduce the triangular double sequences of arbitrary order given by linear recurrences, that generalize some well-known recurrences that appear in enumerative combinatorics. In particular, we focussed on triangular sequences generat

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef06228e4eb3e549a73008a27d7e5492
https://hdl.handle.net/2117/126128

Asymptotics of multiple orthogonal polynomials for a system of two measures supported on a starlike set

Autor: A. López García

Publikováno v: Journal of Approximation Theory. 163:1146-1184

For a system of two measures supported on a starlike set in the complex plane, we study the asymptotic properties of the associated multiple orthogonal polynomials Qn and their recurrence coefficients. These measures are assumed to form a Nikishin-ty

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fe7670c9e9e9b35e52c950b1342db6c
https://doi.org/10.1016/j.jat.2011.03.008

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

On the residue classes of integer sequences satisfying a linear three term recurrence formula

Autor: Takao Komatsu, Carsten Elsner

Publikováno v: Linear Algebra and its Applications. (4):933-947

In this paper we investigate linear three-term recurrence formulae Zn=T(n)Zn-1+U(n)Zn-2(n⩾2) with sequences of integers (T(n))n⩾0 and (U(n))n⩾0, which are ultimately periodic modulo m, e.g.(T(n)modm)n⩾0=(a0,a1,a2,…,aρ,T1,T2,…,Tw¯)(U(n)m

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75d21be58bf6fb5098b8b77ba67a2f59

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.