Related papers: Zsigmondy's Theorem for Chebyshev polynomials

Let t be any integer and fix an odd prime ell. Let Phi(x) = T_ell^n(x)-t denote the n-fold composition of the Chebyshev polynomial of degree ell shifted by t. If this polynomial is irreducible, let K = bbq(theta), where theta is a root of…

There is a well-known factorization of the number $2^{2m}+1$, with $m$ odd, related to the orders of tori of simple Suzuki groups: $2^{2m}+1$ is a product of $a=2^m+2^{(m+1)/2}+1$ and $b=2^m-2^{(m+1)/2}+1$. By the Bang-Zsigmondy theorem,…

We study the zero distribution of the sum of the first $n$ polynomials satisfying a three-term recurrence whose coefficients are linear polynomials. We also extend this sum to a linear combination, whose coefficients are powers of $az+b$…

In this overview paper a direct approach to q-Chebyshev polynomials and their elementary properties is given. Special emphasis is placed on analogies with the classical case. There are also some connections with q-tangent and q-Genocchi…

Let K be a number field with algebraic closure K-bar, let S be a finite set of places of K containing the archimedean places, and let f be a Chebyshev polynomial. We prove that if a in K-bar is not preperiodic, then there are only finitely…

For an analytic function $\phi(z)$ with a Laurent expansion at $\infty$ of the form \begin{equation*} \phi(z)=z+c_{0}+\frac{c_{1}}{z}+\frac{c_{2}}{z^{2}}+\cdots, \end{equation*} the Faber polynomial $F_n$ of degree $n$ associated to $\phi$…

We demonstrate that if $p\in\mathbb{R}[x]$ and $p$ is not an even function, then $\{p(k)\}^{\infty}_{k=0}$ is not a multiplier sequence for the basis of Chebyshev polynomials of the first kind. We also give a characterization of geometric…

Given $n$ polynomials $p_1, \dots, p_n$ of degree at most $n$ with $\|p_i\|_\infty \le 1$ for $i \in [n]$, we show there exist signs $x_1, \dots, x_n \in \{-1,1\}$ so that \[\Big\|\sum_{i=1}^n x_i p_i\Big\|_\infty < 30\sqrt{n}, \] where…

In this paper, we study the asymptotics of the discrete Chebyshev polynomials tn (z, N) as the degree grows to infinity. Global asymptotic formulas are obtained as n \rightarrow \infty, when the ratio of the parameters n/N = c is a constant…

In this paper we follow the general approach, proposed earlier by the first author, which is derived from the invariant theory field and provides a way of obtaining of the polynomial identities for any arbitrary polynomial family. We…

We propose a new interpretation of the classical index of appearance for second order linear recursive sequences. It stems from the formula \[ C_{n}(t)-2 =\frac{\Delta}{Q^{n}}\ L_n^2,\ \ \ \text{where} \ \ t= (T^2-2Q)/Q, \ \Delta = T^2-4Q,…

We prove a Polya-Vinogradov type variation of the the Chebotarev density theorem for function fields over finite fields valid for "incomplete intervals" $I \subset \mathbb{F}_p$, provided $(p^{1/2}\log p)/|I| = o(1)$. Applications include…

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…

After fixing a triangulation $L$ of a $k$-dimensional simplex that has no new vertices on the boundary, we introduce a triangulation operation on all simplicial complexes that replaces every $k$-face with a copy of $L$, via a sequence of…

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…

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…

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.

This paper considers the approximation of a monomial $x^n$ over the interval $[-1,1]$ by a lower-degree polynomial. This polynomial approximation can be easily computed analytically and is obtained by truncating the analytical Chebyshev…

Under sufficiently strong assumptions about the first term in an arithmetic progression, we prove that for any integer $a$, there are infinitely many $n\in \mathbb N$ such that for each prime factor $p|n$, we have $p-a|n-a$. This can be…

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…