We introduce quantized Chebyshev polynomials as deformations of generalized Chebyshev polynomials previously introduced by the author in the context of acyclic coefficient-free cluster algebras. We prove that these quantized polynomials arise in cluster algebras with principal coefficients associated to acyclic quivers of infinite representation types and equioriented Dynkin quivers of type A. ...

Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers are suitable for creating a Diffie-Hellman-like key exchange algorithm that is able to withstand attacks using quantum computers. The algorithm takes advantage of the commutative properties of Chebyshev polynomials of the first kind. We show how T polynomial values can be computed faster and how the underlyi...

in this paper, a new numerical method for solving time-fractional diffusion equations is introduced. for this purpose, finite difference scheme for discretization in time and chebyshev collocation method is applied. also, to simplify application of the method, the matrix form of the suggested method is obtained. illustrative examples show that the proposed method is very efficient and accurate.

in this paper, operational matrices of riemann-liouville fractional integration and caputo fractional differentiation for shifted jacobi polynomials are considered. using the given initial conditions, we transform the fractional differential equation (fde) into a modified fractional differential equation with zero initial conditions. next, all the existing functions in modified differential equ...

For the Hahn and Krawtchouk polynomials orthogonal on the set {0, . . . , N} new identities for the sum of squares are derived which generalize the trigonometric identity for the Chebyshev polynomials of the first and second kind. These results are applied in order to obtain conditions (on the degree of the polynomials) such that the polynomials are bounded (on the interval [0, N ]) by their va...

In this paper, an Adomian decomposition method using Chebyshev orthogonal polynomials is proposed to solve a well-known class of weakly singular Volterra integral equations. Comparison with the collocation method using polynomial spline approximation with Legendre Radau points reveals that the Adomian decomposition method using Chebyshev orthogonal polynomials is of high accuracy and reduces th...

We completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and the expected value for the period and preperiod of iterating Chebyshev polynomials.

We construct a simple closed-form representation of degree-ordered system of bivariate Chebyshev-I orthogonal polynomials Tn,r(u, v, w) on simplicial domains. We show that these polynomials Tn,r(u, v, w), r = 0, 1, . . . , n; n ≥ 0 form an orthogonal system with respect to the Chebyshev-I weight function.

In this talk, we are concerned with embedded formulae of the Chebyshev collocation methods [1] developed recently. We introduce two Chebyshev collocation methods based on generalized Chebyshev interpolation polynomials [2], which are used to make an automatic integration method. We apply an elegant algorithm of generalized Chebyshev interpolation increasing the node points to make an error esti...