搜索结果: 1-4 共查到“数学 recurrences”相关记录4条 . 查询时间(0.078 秒)
Let K be an algebraically closed field of characteristic zero and let f ∈ K[x]. The m-th cyclic resultant of f is rm = Res(f, xm − 1). A generic monic polynomial is determined by its full sequen...
A note on Lucas L binomials and Ward Horadam binomials recurrences
extended Lucas polynomial sequences generalized multinomial co-efficients
2011/2/22
As a matter of continuation of [45, 2010] - we deliver here H(x)-binomials’ re-currence formula appointed by Ward-Horadam H(x) = hHn(x)in≥0 functions’sequence which comprises in H ≡ H(x = 1) number se...
Integrability and non-integrability of periodic non-autonomous Lyness recurrences
Periodic dierence equations integrability non-integrability
2011/2/25
This paper studies non-autonomous Lyness type recurrences of the form xn+2 =(an + xn)=xn+1, where fangn is a k-periodic sequence of positive numbers with prime period k. We show that for the cases k 2...
Bounds for Linear Recurrences with Restricted Coefficients
Recurrence Restricted Coefficients Power Series Triangular Matrices
2008/7/2
This paper derives inequalities for general linear recurrences. Optimal bounds for solutions to the recurrence are obtained when the coefficients of the recursion lie in intervals that include zero. A...