نتایج جستجو برای: second kind chebyshev polynomials
تعداد نتایج: 734458 فیلتر نتایج به سال:
In a recent article, the first and second kinds of multivariate Chebyshev polynomials fractional degree, relevant integral repesentations, have been studied. this we introduce pseudo-Lucas functions show possible applications these new functions. For kind, compute Newton sum rules any orthogonal polynomial set starting from entries Jacobi matrix. representation formulas for powers r×r matrix, a...
In this paper, we derive a single formula for the entries of the rth (r ∈ N) power of a certain real circulant matrix of odd and even order, in terms of the Chebyshev polynomials of the first and second kind. In addition, we give two Maple 13 procedures along with some numerical examples in order to verify our calculation.
We study generating functions for the number of permutations in Sn subject to two restrictions. One of the restrictions belongs to S3, while the other to Sk. It turns out that in a large variety of cases the answer can be expressed via Chebyshev polynomials of the second kind. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 30B70, 42C05
We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 30B70, 42C05
We study generating functions for the number of permutations in Sn subject to two restrictions. One of the restrictions belongs to S3, while the other to Sk. It turns out that in a large variety of cases the answer can be expressed via Chebyshev polynomials of the second kind. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 30B70, 42C05
We study generating functions for the number of permutations in Sn subject to two restrictions. One of the restrictions belongs to S3, while the other belongs to Sk. It turns out that in a large variety of cases the answer can be expressed via Chebyshev polynomials of the second kind.
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 30B70, 42C05
We study generating functions for the number of permutations in Sn subject to set of restrictions. One of the restrictions belongs to S3, while the others to Sk. It turns out that in a large variety of cases the answer can be expressed via continued fractions, and Chebyshev polynomials of the second kind. 2001 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 30B70 42C05
We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 30B70, 42C05
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید