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

We study residual polynomials, $R_{x_0,n}^{(\mathfrak{e})}$, $\mathfrak{e}\subset\mathbb{R}$, $x_0\in\mathbb{R}\setminus\mathfrak{e}$, which are the degree at most $n$ polynomials with $R(x_0)=1$ that minimize the $\sup$ norm on…

We investigate semi-classical generalizations of the Charlier and Meixner polynomials, which are discrete orthogonal polynomials that satisfy three-term recurrence relations. It is shown that the coefficients in these recurrence relations…

In this paper we generalize and specialize generating functions for classical orthogonal polynomials, namely Jacobi, Gegenbauer, Chebyshev and Legendre polynomials. We derive a generalization of the generating function for Gegenbauer…

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…

The Alexander-Hirschowitz theorem says that a general collection of $k$ double points in ${\bf P}^n$ imposes independent conditions on homogeneous polynomials of degree $d$ with a well known list of exceptions. We generalize this theorem to…

Algorithms and underlying mathematics are presented for numerical computation with periodic functions via approximations to machine precision by trigonometric polynomials, including the solution of linear and nonlinear periodic ordinary…

We investigate the differential equation for the Jacobi-type polynomials which are orthogonal on the interval $[-1,1]$ with respect to the classical Jacobi measure and an additional point mass at one endpoint. This scale of higher-order…

The best polynomial approximation and Chebyshev approximation are both important in numerical analysis. In tradition, the best approximation is regarded as more better than the Chebyshev approximation, because it is usually considered in…

We first interpret Pell's equation satisfied by Chebyshev polynomials for each degree t, as a certain Positivstellensatz, which then yields for each integer t, what we call a generalized Pell's equation, satisfied by reciprocals of…

We show that (k,m)-linear mappings, introduced by I. Chernega and A. Zagorodnyuk in [3], are particular cases of polynomials. As corollaries, we expose some apparently overlooked properties in the literature. For instance, every multilinear…

Generalized polynomials are mappings obtained from the conventional polynomials by the use of operations of addition, multiplication and taking the integer part. Extending the classical theorem of H. Weyl on equidistribution of polynomials,…

In this paper we derive new identities satisfied by Chebyshev polynomials of the first kind and big q-Jacobi polynomials. An immediate benefit of the derived identities is the achievement of closed-form expressions for the Laurent…

Sergey Pinchuk discovered a class of pairs of real polynomials in two variables that have a nowhere vanishing Jacobian determinant and define maps of the real plane to itself that are not one-to-one. This paper describes the asymptotic…

The discrete Fourier analysis on the $30^{\degree}$-$60^{\degree}$-$90^{\degree}$ triangle is deduced from the corresponding results on the regular hexagon by considering functions invariant under the group $G_2$, which leads to the…

We construct multiple representations relative to different bases of the generalized Tschebyscheff polynomials of second kind. We build the change-of-basis matrices between the generalized Tschebyscheff of the second kind polynomial basis…

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

We investigate a relationship between MacMahon's generalized sum-of-divisors functions and Chebyshev polynomials of the first kind. This determines a recurrence relation to compute these functions, as well as proving a conjecture of…

Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…

Geometry of sparse systems of polynomial equations (i.e. the ones with prescribed monomials and generic coefficients) is well studied in terms of their Newton polytopes. The results of this study are colloquially known as the…

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…