Fibonacci numbers and orthogonal polynomials

نویسنده

  • Christian Berg
چکیده

We prove that the sequence (1/Fn+2)n≥0 of reciprocals of the Fibonacci numbers is a moment sequence of a certain discrete probability, and we identify the orthogonal polynomials as little q-Jacobi polynomials with q = (1− √ 5)/(1+ √ 5). We prove that the corresponding kernel polynomials have integer coefficients, and from this we deduce that the inverse of the corresponding Hankel matrices (1/Fi+j+2) have integer entries. We prove analogous results for the Hilbert matrices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Relations Between Generalized Fibonacci and Catalan Numbers

In a recent paper Aleksandar Cvetkovi c, Predrag Rajkovi c and Miloš Ivkovi c proved that for the Catalan numbers Cn the Hankel determinants of the sequence Cn þ Cnþ1 are Fibonacci numbers. Their proof depends on special properties of the corresponding orthogonal polynomials. In this paper we give a generalization of their result by other methods in order to give more insight into the situation...

متن کامل

The Generating Function of the Generalized Fibonacci Sequence

Using tools of the theory of orthogonal polynomials we obtain the generating function of the generalized Fibonacci sequence established by Petronilho for a sequence of real or complex numbers {Qn}n=0 defined by Q0 = 0, Q1 = 1, Qm = ajQm 1 + bjQm 2, m ⌘ j (mod k), where k 3 is a fixed integer, and a0, a1, . . . , ak 1, b0, b1, . . . , bk 1 are 2k given real or complex numbers, with bj 6= 0 for 0...

متن کامل

On convolved generalized Fibonacci and Lucas polynomials

We define the convolved hðxÞ-Fibonacci polynomials as an extension of the classical con-volved Fibonacci numbers. Then we give some combinatorial formulas involving the hðxÞ-Fibonacci and hðxÞ-Lucas polynomials. Moreover we obtain the convolved hðxÞ-Fibo-nacci polynomials from a family of Hessenberg matrices. Fibonacci numbers and their generalizations have many interesting properties and appli...

متن کامل

Sobolev orthogonal polynomials in computing of Hankel determinants

In this paper, we study closed form evaluation for some special Hankel determinants arising in combinatorial analysis, especially for the bidirectional number sequences. We show that such problems are directly connected with the theory of quasi-definite discrete Sobolev orthogonal polynomials. It opens a lot of procedural dilemmas which we will try to exceed. A few examples deal with Fibonacci ...

متن کامل

GENERALIZED q - FIBONACCI NUMBERS

We introduce two sets of permutations of {1, 2, . . . , n} whose cardinalities are generalized Fibonacci numbers. Then we introduce the generalized q-Fibonacci polynomials and the generalized q-Fibonacci numbers (of first and second kind) by means of the major index statistic on the introduced sets of permutations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996