相关论文: Generalizations of Chebyshev Polynomials and Polyn…

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^2$ by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization…

We present a general framework, treating Lipschitz domains in Riemannian manifolds, that provides conditions guaranteeing the existence of norming sets and generalized local polynomial reproduction - a powerful tool used in the analysis of…

We study explicit continued fraction expansions for certain series. Some of these expansions have symmetry that generalizes some remarkable examples discovered independently by Kmosek and Shallit. Furthermore, we prove the following…

We present a simple technique to compute moments of derivatives of unitary characteristic polynomials. The first part of the technique relies on an idea of Bump and Gamburd: it uses orthonormality of Schur functions over unitary groups to…

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…

Let K be an algebraically closed field of characteristic 0. Following Medvedev-Scanlon, a polynomial of degree d > 1 is said to be disintegrated if neither f nor -f is linearly conjugate to x^d or T_d(x) where T_d is the Chebyshev…

An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…

In the present paper we find a simple algorithm for counting Jacobian group of the generalized Petersen graph GP(n,k). Also, we obtain a closed formula for the number of spanning trees of this graph in terms of Chebyshev polynomials.

The goal of this article is to provide a general multivariate framework that synthesizes well-known non-tensorial polnomial interpolation schemes on the Padua points, the Morrow-Patterson-Xu points and the Lissajous node points into a…

Given a reciprocal/palindromic polynomial of even degree, we show that the gamma vector is essentially given by an inverted Chebyshev polynomial basis expansion. As an immediate consequence, we characterize real-rootedness of a linear…

By expressing polynomials in the basis of Chebyshev polynomials, certain families of hyperbolic polynomials appear naturally. Some of these families have all their roots in the interval $[-2,2]$. In many cases the span of the family of…

Markov's inequality for algebraic polynomials on $\left[-1,1\right]$ goes back to more than a century and it is widely used in approximation theory. Its asymptotically sharp form for unions of finitely many intervals has been found only in…

In his paper of 2000, Kenneth B. Stolarsky made various observations and conjectures about discriminants and generating functions of certain types of Chebyshev-like polynomials. We prove several of these conjectures. One of our proofs…

We study generating functions for the number of involutions in $S_n$ avoiding (or containing once) 132, and avoiding (or containing once) an arbitrary permutation $\tau$ on $k$ letters. In several interesting cases the generating function…

Exponential divided differences arise in numerical linear algebra, matrix-function evaluation, and quantum Monte Carlo simulations, where they serve as kernel weights for time evolution and observable estimation. Efficient and numerically…

In this report, we present a systematic account of mathematical structures of certain special polynomials arisen from the energy study of the superintegrable $N$-state chiral Potts model with a finite number of sizes. The polynomials of…

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",…

We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…

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…

We look for differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to the classical weight function for the Jacobi polynomials together with point masses at both…