相关论文: How many Zolotarev fractions are there?
A polynomial $p\in \mathbb{C}[z]$ with three finite values is called the Zolotarev polynomial. For a class of such polynomials with the given degree, given passport and simple critical points we define a \emph{combinatorial moduli space}. A…
A polynomial with exactly two critical values is called a generalized Chebyshev polynomial. A polynomial with exactly three critical values is called a Zolotarev polynomial. Two Chebyshev polynomials $f$ and $g$ are called Z-homotopic, if…
We consider the Mellin transforms of certain Chebyshev functions based upon the Chebyshev polynomials. We show that the transforms have polynomial factors whose zeros lie all on the critical line or on the real line. The polynomials with…
The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors $p_n(s)$, whose zeros lie all on the `critical line' $\Re\,s=1/2$ or on the real…
Using Chebyshev polynomialsof both kinds, we construct rational fractions which are convergents of the smallest root of $x^2-\alpha x+1$ for $\alpha=3,4,5,\dots$.Some of the underlying identities suggest an identity involving…
By using purely algebraic tools, we establish well-known properties of roots of Chebyshev polynomials. Especially, we show that these zeros are simple and lie in $(-1,1)$ and we prove in two ways that they are mostly irrational.
The discriminants of certain polynomials related to Chebyshev polynomials factor into the product of two polynomials, one of which has coefficients that are much larger than the other's. Remarkably, these polynomials of dissimilar size have…
We count the number of critical points of a modular form with real Fourier coefficients in a $\gamma$-translate of the standard fundamental domain $\mathcal{F}$ (with $\gamma\in \mathrm{SL}_2(\mathbb{Z})$). Whereas by the valence formula…
We begin by considering a sequence of polynomials in three variables whose coefficients count restricted binary overpartitions with certain properties. We then concentrate on two specific subsequences that are closely related to the…
We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials.…
A classic result of Ritt describes polynomials invertible in radicals: they are compositions of power polynomials, Chebyshev polynomials and polynomials of degree at most 4. In this paper we prove that a polynomial invertible in radicals…
There is presented an approach to find an approximation polynomial of a function with two variables based on the two dimensional discrete Fourier transform. The approximation polynomial is expressed through Chebyshev polynomials. There is…
We construct one and two parameter deformations of the two dimensional Chebyshev polynomials with simple recurrence coefficients, following the algorithm in [3]. Using inverse scattering techniques, we compute the corresponding…
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…
In this article, we prove that every unicritical polynomial map that has only rational multipliers is either a power map or a Chebyshev map. This provides some evidence in support of a conjecture by Milnor concerning rational maps whose…
We make a number of comments on Chebyshev polynomials for general compact subsets of the complex plane. We focus on two aspects: asymptotics of the zeros and explicit Totik--Widom upper bounds on their norms.
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…
We study weighted Chebyshev polynomials on compact subsets of the complex plane with respect to a bounded weight function. We establish existence and uniqueness of weighted Chebyshev polynomials and derive weighted analogs of Kolmogorov's…
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…
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…