Hankel Determinants of Some Sequences of Polynomials

نویسنده

  • SIVARAMAKRISHNAN SIVASUBRAMANIAN
چکیده

Ehrenborg gave a combinatorial proof of Radoux’s theorem which states that the determinant of the (n + 1)× (n + 1) dimensional Hankel matrix of exponential polynomials is x ∏n i=0 i!. This proof also shows the result that the (n + 1) × (n + 1) Hankel matrix of factorial numbers is ∏n k=1(k!) . We observe that two polynomial generalizations of factorial numbers also have interesting determinant values for Hankel matrices. A polynomial generalization of the determinant of the Hankel matrix with entries being fixed-point free involutions on the set [2n] is given next. We also give a bivariate non-crossing analogue of a theorem of Cigler about the determinant of a similar Hankel matrix.

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

ثبت نام

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

منابع مشابه

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 ...

متن کامل

Determinants and permanents of Hessenberg matrices and generalized Lucas polynomials

In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...

متن کامل

A New Class of q-Fibonacci Polynomials

the simple evaluation (3.2 ). This fact led me to a thorough study of this q-analogue via a combinatorial approach based on Morse code sequences. We show that these q-Fibonacci polynomials satisfy some other recurrences too, generalize some well-known facts for ordinary Fibonacci polynomials to this case, derive their generating function and study the special values Fn(1,−q ) and Fn(1,−1) which...

متن کامل

From a Polynomial Riemann Hypothesis to Alternating Sign Matrices

This paper begins with a brief discussion of a class of polynomial Riemann hypotheses, which leads to the consideration of sequences of orthogonal polynomials and 3-term recursions. The discussion further leads to higher order polynomial recursions, including 4-term recursions where orthogonality is lost. Nevertheless, we show that classical results on the nature of zeros of real orthogonal pol...

متن کامل

Toda Chain, Sheffer Class of Orthogonal Polynomials and Combinatorial Numbers

A classification of Hankel determinant solutions of the restricted Toda chain equations is presented through polynomial Ansatz for moments. Each solution corresponds to the Sheffer class orthogonal polynomials. In turn, these solutions are equivalent to solutions with separated variables in Toda chain. These solutions lead naturally to explicit Hankel determinants of some combinatorial numbers.

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2010