Three theorems are given for the integral zeros of Krawtchouk polynomials. First, five new infinite families of integral zeros for the binary (q = 2) Krawtchouk polynomials are found. Next, a lower bound is given for the next integral zero for the degree four polynomial. Finally, three new infinite families in q are found for the degree three polynomials. The techniques used are from elementary...

In this contribution we propose a method for generating OWA weighting vectors from the individual assessments on a set of alternatives in such a way that these weights minimize the disagreement among individual assessments and the outcome provided by the OWA operator. For measuring that disagreement we have aggregated distances between individual and collective assessments by using a metric and...

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in C. We study this problem on general sets, but devote special attention to product sets such as cube and polydisk. We also establish a multivariate analog of the Hilbert-Fekete upper bound for the integer Chebyshev constant, which depends on the dimens...

In this paper, a method based on Chebyshev polynomials is developed for examination of geometrically nonlinear behaviour of thin rectangular composite laminated plates under end-shortening strain. Different boundary conditions and lay-up configurations are investigated and classical laminated plate theory is used for developing the equilibrium equations. The equilibrium equations are solved dir...

In this paper, the wavelet method based on the Chebyshev polynomials of the second kind is introduced and used to solve systems of integral equations. Operational matrices of integration, product, and derivative are obtained for the second kind Chebyshev wavelets which will be used to convert the system of integral equations into a system of algebraic equations. Also, the error is analyzed and ...

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.

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