We say that a monic polynomial with integer coefficients is polygomial if its each zero obtained by squaring the edge or diagonal of regular n-gon unit circumradius. find connections certain polygomials Morgan-Voyce polynomials and further Chebyshev second kind.

We construct an Alexander-type invariant for oriented doodles from a deformation of the Tits representation twin group and Chebyshev polynomials second kind. Like Alexander polynomial, our vanishes on unlinked with more than one component. also include values several doodles.

The main aim of this paper is to discuss about, Chebyshev wavelets based approximation solution for linear and non-linear differential equations arising in science and engineering. The basic idea of this method is to obtain the approximate solution of a differential equation in a series of Cheybyshev wavelets. For this purpose, operational matrix for Cheybyshev wavelets is derived. By applying ...

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