Related papers: Chebyshev polynomials in the complex plane and on …
The generalized complex numbers can be realized in terms of $2\times2$ or higher-order matrices and can be exploited to get different ways of looking at the trigonometric functions. Since Chebyshev polynomials are linked to the power of…
The aim of the present work is to introduce a method based on Chebyshev polynomials for the numerical solution of a system of Cauchy type singular integral equations of the first kind on a finite segment. Moreover, an estimation error is…
A Chebyshev expansion is a series in the basis of Chebyshev polynomials of the first kind. When such a series solves a linear differential equation, its coefficients satisfy a linear recurrence equation. We interpret this equation as the…
We show how polynomial mappings of degree k from a union of disjoint intervals onto [-1,1] generate a countable number of special cases of a certain generalization of the Chebyshev Polynomials. We also derive a new expression for these…
Approximation theory plays a central role in numerical analysis, undergoing continuous evolution through a spectrum of methodologies. Notably, Lebesgue, Weierstrass, Fourier, and Chebyshev approximations stand out among these methods.…
The original Gelfond-Schnirelman method, proposed in 1936, uses polynomials with integer coefficients and small norms on $[0,1]$ to give a Chebyshev-type lower bound in prime number theory. We study a generalization of this method for…
In this paper we evaluate Chebyshev polynomials of the second-kind on a class of symmetric integer matrices, namely on adjacency matrices of simply laced Dynkin and extended Dynkin diagrams. As an application of these results we explicitly…
Orthogonal polynomials have very useful properties in the solution of mathematical problems, so recent years have seen a great deal in the field of approximation theory using orthogonal polynomials. In this paper, we characterize the…
In this work, considering a general subclass of bi-univalent functions and using the Chebyshev polynomials, we obtain coefficient expansions for functions in this class.
We introduce a multivariate generalization of normalized Chebyshev polynomials of the second kind. We prove that these polynomials arise in the context of cluster characters associated to Dynkin quivers of type $\mathbb A$ and…
The even and odd Zernike Polynomials R_n^m(x) can be expanded into sums of even and odd Chebyshev Polynomials T_i(x). This manuscript provides closed forms for the rational expansion coefficients c_{n,m,i} for a set of small 0 <= n-m <= 6…
Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…
Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…
We study how often exceptional configurations of irreducible polynomials over finite fields occur in the context of prime number races and Chebyshev's bias. In particular, we show that three types of biases, which we call "complete bias",…
Given a polynomial f and a finite field F one can construct a directed graph where the vertices are the values in the finite field, and emanating from each vertex is an edge joining the vertex to its image under f. When f is a Chebyshev…
This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best approximants to specific monomials by polynomials of lower degree relative to the uniform…
In approximation theory, logarithmic derivatives of complex polynomials are called simple partial fractions (SPF) as suggested by Eu.P. Dolzhenko. Many solved and unsolved extremal problems related to SPF are traced back to works of G.…
In this paper, we prove some extensions of recent results given by Shkredov and Shparlinski on multiple character sums for some general families of polynomials over prime fields. The energies of polynomials in two and three variables are…
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by…
We study the solution set to multivariate Chebyshev approximation problem, focussing on the ill-posed case when the uniqueness of solutions can not be established via strict polynomial separation. We obtain an upper bound on the dimension…