Related papers: Chebyshev polynomials on generalized Julia sets

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…

Let $f_n$ be a random polynomial of degree $n$, whose coefficients are independent and identically distributed random variables with mean-zero and variance one. Let $\Delta(f_n)$ denote the discriminant of $f_n$, that is $\Delta(f_n) =…

The discrete cosine transforms of types V--VIII are generalized to the antisymmetric and symmetric multivariate discrete cosine transforms. Four families of discretely and continuously orthogonal Chebyshev-like polynomials corresponding to…

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…

Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…

It is well known that for every $f\in C^m$ there exists a polynomial $p_n$ such that $p^{(k)}_n\rightarrow f^{(k)}$, $k=0,\ldots,m$. Here we prove such a result for fractional (non-integer) derivatives. Moreover, a numerical method is…

We survey results on Chebyshev polynomials centered around the work of H. Widom. In particular, we discuss asymptotics of the polynomials and their norms and general upper and lower bounds for the norms. Several open problems are also…

This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…

The basic power function $t_n(x)=x^n$ is in some sense a classical limit for large $x$, of the monictised Chebyshev polynomial of the first kind $T_n(x)/2^{n-1}$. A theorem of Ritt says they are the only two families of polynomials $p_n(x)$…

In previous work we computed the number $C_n(q)$ of ideals of codimension $n$ of the algebra ${\mathbb{F}}_q[x,y,x^{-1}, y^{-1}]$ of two-variable Laurent polynomials over a finite field: it turned out that $C_n(q)$ is a palindromic…

The discrete Chebyshev polynomials $t_n(x,N)$ are orthogonal with respect to a distribution function, which is a step function with jumps one unit at the points $x=0,1,..., N-1$, N being a fixed positive integer. By using a double integral…

We examine the distributions of non-commutative polynomials of non-atomic, freely independent random variables. In particular, we obtain an analogue of the Strong Atiyah Conjecture for free groups thus proving that the measure of each atom…

For $m$ an even positive integer and $p$ a prime, we show that the generalized Euler polynomial $E_{mp}^{(mp)}(x)$ is in Eisenstein form with respect to $p$ if and only if $p$ does not divide $m (2^m-1)B_m$. As a consequence, we deduce that…

A recursion formula for derivatives of Chebyshev polynomials is replaced by an explicit formula.

Recently, $(\beta,\gamma)$-Chebyshev functions, as well as the corresponding zeros, have been introduced as a generalization of classical Chebyshev polynomials of the first kind and related roots. They consist of a family of orthogonal…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Ordinary differential equations and boundary value problems arise in many aspects of mathematical physics. Chebyshev differential equation is one special case of the Sturm-Liouville boundary value problem. Generating function, recursive…

Motivated by the product formula of the Chebyshev polynomials of the second kind $U_n(x)$, we newly introduce the partial Chebyshev polynomials $U^{\mathrm{e}}_n(x)$ and $U^{\mathrm{o}}_n(x)$ and derive their basic properties, relations to…

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

We introduce several notions of `random fewnomials', i.e. random polynomials with a fixed number f of monomials of degree N. The f exponents are chosen at random and then the coefficients are chosen to be Gaussian random, mainly from the…