نتایج جستجو برای: second kind chebyshev wavelet
تعداد نتایج: 736624 فیلتر نتایج به سال:
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
The purpose of this survey is to present some approximation and shape preserving properties of the so-called nonlinear (more exactly sublinear) and positive, max-product operators, constructed by starting from any discrete linear approximation operators, obtained in a series of recent papers jointly written with B. Bede and L. Coroianu. We will present the main results for the max-product opera...
An operational approach introduced by Gould and Hopper to the construction of generalized Hermite polynomials is followed in the hypercomplex context to build multidimensional generalized Hermite polynomials by the consideration of an appropriate basic set of monogenic polynomials. Directly related functions, like Chebyshev polynomials of first and second kind are constructed.
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 consider the condition of orthogonal polynomials, encoded by the coeecients of their three-term recurrence relation, if the measure is given by modiied moments (i.e. integrals of certain polynomials forming a basis). The results concerning various polynomial bases are illustrated with simple examples of generating (possibly shifted) Chebyshev polynomials of rst and second kind.
By using Dickson polynomials in several variables and Chebyshev polynomials of the second kind, we derive the explicit expression of the entries in the array defining the sequence A185905. As a result, we obtain a straightforward proof of some conjectures of Jeffery concerning this sequence and other related ones.
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 S n subject to two restrictions. One of the restrictions belongs to S 3 , while the other belongs to S k. It turns out that in a large variety of cases the answer can be expressed via Chebyshev polynomials of the second kind.
In this paper, we propose a new method to design an observer and control the linear singular systems described by Chebyshev wavelets. The idea of the proposed approach is based on solving the generalized Sylvester equations. An example is also given to illustrate the procedure.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید