Complex Factorization By Chebysev Polynomials

Yükleniyor...
Küçük Resim

Tarih

2018

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Univ Studi Catania, Dipt Matematica

Erişim Hakkı

info:eu-repo/semantics/openAccess

Özet

Let {a(i)}, {b(i)} be real numbers for 0 <= i <= r - 1, and define a r-periodic sequence {v(n)} with initial conditions v(0) , v(1) and recurrences v(n) = a(t)v(n-1) vertical bar b(t)v(n-)(2) where n t (mod r) (n >= 2). In this paper, by aid of Chebyshev polynomials, we introduce a new method to obtain the complex factorization of the sequence {v(n)} so that we extend some recent results and solve some open problems. Also, we provide new results by obtaining the binomial sum for the sequence {v(n)} by using Chebyshev polynomials.

Açıklama

Anahtar Kelimeler

Chebyshev polynomials, complex factorization, binomial sums

Kaynak

Matematiche

WoS Q Değeri

N/A

Scopus Q Değeri

Q3

Cilt

73

Sayı

1

Künye

Sahin, M., & Yilmaz, S. (2018). Complex Factorization by Chebysev Polynomials.Le Matematiche 73(1).179-189.