General Linear Recurrence Sequences and Their Convolution Formulas
Copyright policy )General Linear Recurrence Sequences and Their Convolution Formulas
We extend a technique recently introduced by Chen Zhuoyu and Qi Lan in order to find convolution formulas for second order linear recurrence polynomials generated by 1 1 + a t + b t 2 x . The case of generating functions containing parameters, even in the numerator is considered. Convolution formulas and general recurrence relations are derived. Many illustrative examples and a straightforward extension to the case of matrix polynomials are shown.
- Roma Tre University Italy
liner recursions, gegenbauer polynomials, humbert polynomials, Gegenbauer polynomials, classical polynomials in several variables, classical number sequences, QA1-939, convolution formulas, Humbert polynomials, Mathematics
liner recursions, gegenbauer polynomials, humbert polynomials, Gegenbauer polynomials, classical polynomials in several variables, classical number sequences, QA1-939, convolution formulas, Humbert polynomials, Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!