Related papers: Chebyshev Varieties
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.
We seek to determine a real algebraic variety from a fixed finite subset of points. Existing methods are studied and new methods are developed. Our focus lies on aspects of topology and algebraic geometry, such as dimension and defining…
The purpose of this note is to extend in a simple and unified way some results on orthogonal polynomials with respect to the weight function $$\frac{|T_m(x)|^p}{\sqrt{1-x^2}}\;,\quad-1<x<1\;,$$ where $T_m$ is the Chebyshev polynomial of the…
We present numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the…
In this paper an explicit form of generalized Chebyshev Koornwinder's type polynomial of first kind in terms of the Bernstein basis of fixed degree $n$ is provided. Moreover, we investigate generalized Chebyshev Koornwinder's type…
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 analogy between the nth power function and the nth Chebyshev polynomial is pursued, leading to consideration of Chebyshev radicals as analogous to ordinary radicals and Chebyshev exponents to ordinary exponents, and the cosine and…
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…
This article provides a simple trigonometric method for determining how many roots of a quartic equation are real and how many are complex, without solving the equation. The approach replaces the quartic's classical discriminant -- a…
The notion of the weighted degree of a polynomial is a basic tool in Affine Algebraic Geometry. In this paper, we study the properties of the weighted multidegrees of polynomial automorphisms by a new approach which focuses on stable…
A permutation is called layered if it consists of the disjoint union of substrings (layers) so that the entries decrease within each layer, and increase between the layers. We find the generating function for the number of permutations on…
A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…
Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…
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.…
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…
We develop a diagrammatic categorification of the polynomial ring Z[x], based on a geometrically defined graded algebra. This construction generalizes to categorification of some special functions, such as Chebyshev polynomials.…
Motivated by the observation that the counting function of a certain base-3 colored partition contains the even perfect numbers as a subsequence, we begin by defining a sequence of polynomials in four variables and discuss their properties…
Over nearly six decades, the Chebyshev polynomials of a discrete real variable have found applications in spin physics, spin tomography, in the development of operator expansions, and in defining tensor operator equivalents. The properties…
Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…
In approximation theory, it is standard to approximate functions by polynomials expressed in the Chebyshev basis. Evaluating a polynomial $f$ of degree n given in the Chebyshev basis can be done in $O(n)$ arithmetic operations using the…