A permutation is said to be alternating if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on n letters that avoid or contain exactly once 132 and also avoid or contain exactly once an arbitrary pattern on k letters. In several interesting cases the generating function depends only on k and i...

We study generating functions for the number of involutions, even involutions, and odd involutions in Sn subject to two restrictions. One restriction is that the involution avoid 3412 or contain 3412 exactly once. The other restriction is that the involution avoid another pattern τ or contain τ exactly once. In many cases we express these generating functions in terms of Chebyshev polynomials o...

Abstract In this paper, the numerical method for solving Abel’s integral equations is presented. This method is based on fractional calculus. Also, Chebyshev polynomials are utilized to apply fractional properties for solving Abel’s integral equations of the first and second kind. The fractional operator is considered in the sense of RiemannLiouville. Although Abel’s integral equations as singu...

Abstract. A permutation is called layered if it consists of the disjoint union of substrings (layers) so that the entries decrease within each layer, and increase between the layers. We find the generating function for the number of permutations on n letters avoiding (1, 2, 3) and a layered permutation on k letters. In the most interesting case of two layers, the generating function depends onl...

In this work we study the different type of regular boundary value problems on a path associated with the Schrödinger operator. In particular, we obtain the Green function for each problem and we emphasize the case of Sturm-Liouville boundary conditions. In any case, the Green function is given in terms of second kind Chebyshev polynomials since they verify a recurrence law similar to the one v...

This paper is concerned with establishing novel expressions that express the derivative of any order orthogonal polynomials, namely, Chebyshev polynomials sixth kind in terms themselves. We will prove these involve certain terminating hypergeometric functions type 4F3(1) can be reduced some specific cases. The derived along linearization formula serve obtaining a numerical solution non-linear o...

We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves alternate) result that their coefficients are non-negative. As a corollary we find that Tn(c cos θ) and Un(c cos θ) are positive definite functions. We further s...

in this study, the problem of determining an optimal trajectory of a nonlinear injection into orbit problem with minimum time was investigated. the method was based on orthogonal polynomial approximation. this method consists of reducing the optimal control problem to a system of algebraic equations by expanding the state and control vector as chebyshev or legendre polynomials with undetermined...