Related papers: Chebyshev systems and Sturm oscillation theory for…

There is $c_{} > 0$ such that for all $f \in C[0,\pi]$ with at most $d-1$ roots inside $(0,\pi)$ $$ \sum_{1 \leq n \leq d}{ \left| \left\langle f, \sin\left( n x\right) \right\rangle \right|} \geq \kappa^{-\kappa^2 \log{\kappa}}\|f\|_{L^2}…

The aim of the present work is to introduce a method based on Chebyshev polynomials for the numerical solution of a system of Cauchy type singular integral equations of the first kind on a finite segment. Moreover, an estimation error 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…

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

We consider the problem of maximizing the sum of squares of the leading coefficients of polynomials $P_{i_1}(x),\ldots ,P_{i_m}(x)$ (where $P_j(x)$ is a polynomial of degree $j$) under the restriction that the sup-norm of $\sum_{j=1}^m…

A central result of Sturm-Liouville theory (also called the Sturm-Hurwitz Theorem) states that if $\phi_k$ is a sequence of eigenfunctions of a second order differential operator on the interval $I \subset \mathbb{R}$, then any linear…

Uniform polynomial approximation, also called minimax approximation or Chebyshev approximation, consists in searching polynomial approximation that minimizes the worst case error. Optimality conditions for the uniform approximation of…

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

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…

The estimates of the uniform norm of the Chebyshev polynomial associated with a compact set $K$ consisting of a finite number of continua in the complex plane are established. These estimates are exact (up to a constant factor) in the case…

We strengthen the Weierstrass approximation theorem by proving that any real-valued continuous function on an interval $I \subset \mathbb{R}$ can be uniformly approximated by a real-valued polynomial whose only (possibly complex) critical…

We derive discrete and oscillatory Chern-Simons matrix models. The method is based on fundamental properties of the associated orthogonal polynomials. As an application, we show that the discrete model allows to prove and extend the…

We consider a discrete best approximation problem formulated in the framework of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. Given a set of samples of input and output of…

A new necessary and sufficient stability test in a tractable number of operations for linear neutral-type delay systems is introduced. It is developed in the Lyapunov-Krasovskii framework via functionals with prescribed derivatives. The…

Spectral polynomial approximation of smooth functions allows real-time manipulation of and computation with them, as in the Chebfun system. Extension of the technique to two-dimensional and three-dimensional functions on hyperrectangles has…

We consider the approximation of a continuous function, defined on a compact set of the $d$-dimensional Euclidean space, by sums of two ridge functions. We obtain a necessary and sufficient condition for such a sum to be a best…

We analyze decay of Chebyshev coefficients and local Chebyshev approximations for functions of finite regularity on finite intervals, focusing on the framework where the interval length tends to zero while the number of approximation nodes…

Polynomial series approximations are a central theme in approximation theory due to their utility in an abundance of numerical applications. The two types of series, which are featured most prominently, are Taylor series expansions and…

For $d \geq 2, \ D \geq 1$, let $\mathscr{P}_{d,D}$ denote the set of all degree $d$ polynomials in $D$ dimensions with real coefficients without linear terms. We prove that for any Calder\'{o}n-Zygmund kernel, $K$, the maximally modulated…

We present a new algorithm for finding isolated zeros of a system of real-valued functions in a bounded interval in $\mathbb{R}^n$. It uses the Chebyshev proxy method combined with a mixture of subdivision, reduction methods, and…