Combinatorics of generalized Tchebycheff polynomials

نویسندگان

  • Dongsu Kim
  • Jiang Zeng
چکیده

By considering a family of orthogonal polynomials generalizing the Tchebycheff polynomials of the second kind we refine the corresponding results of De Sainte-Catherine and Viennot on Tchebycheff polynomials of the second kind (Lecture Notes in Mathematics, vol. 1171, 1985, Springer-Verlag, 120). © 2003 Elsevier Science Ltd. All rights reserved.

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

ثبت نام

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

منابع مشابه

A Conic Programming Approach to Generalized Tchebycheff Inequalities

Consider the problem of finding optimal bounds on the expected value of piece-wise polynomials over all measures with a given set of moments. This is a special class ofGeneralized Tchebycheff Inequalities in probability theory. We study this problem within the framework of conic programming. Relying on a general approximation scheme for conic programming, we show that these bounds can be numeri...

متن کامل

On composition of generating functions

In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...

متن کامل

A generalized class of modified R-polynomials

In this paper we define a family of polynomials closely related to the modified R-polynomials of the symmetric group and begin work toward a classification of the polynomials by using a combinatorial interpretation involving subwords of the maximal element in the Bruhat order. The problem of determining the precise conditions which make one of these polynomials zero motivates our work. We state...

متن کامل

Generalized Bell Polynomials and the Combinatorics of Poisson Central Moments

We introduce a family of polynomials that generalizes the Bell polynomials, in connection with the combinatorics of the central moments of the Poisson distribution. We show that these polynomials are dual of the Charlier polynomials by the Stirling transform, and we study the resulting combinatorial identities for the number of partitions of a set into subsets of size at least 2.

متن کامل

Ubiquity of Kostka Polynomials

We report about results revolving around Kostka–Foulkes and parabolic Kostka polynomials and their connections with Representation Theory and Combinatorics. It appears that the set of all parabolic Kostka polynomials forms a semigroup, which we call Liskova semigroup. We show that polynomials frequently appearing in Representation Theory and Combinatorics belong to the Liskova semigroup. Among ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Eur. J. Comb.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2003