Related papers: The Gibbs phenomenon for the Krawtchouk polynomial…

Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…

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…

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

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…

We study the Lusin approximation problem for real-valued measurable functions on Carnot groups. We prove that k-approximate differentiability almost everywhere is equivalent to admitting a Lusin approximation by $C^{k}_{\mathbb{G}}$ maps.…

The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…

This expository article proves some results of Ferguson, on the approximation of continuous functions on a compact subset of R by polynomials with integral coefficients.

There is presented an approach to find an approximation polynomial of a function with two variables based on the two dimensional discrete Fourier transform. The approximation polynomial is expressed through Chebyshev polynomials. There is…

Let $F_n$ denote the distribution function of the normalized sum $Z_n = (X_1 + \dots + X_n)/\sigma\sqrt{n}$ of i.i.d. random variables with finite fourth absolute moment. In this paper, polynomial rates of convergence of $F_n$ to the normal…

We introduce and study the approximation properties of $g$-polynomials, defined as linear combinations of iterated Stieltjes integrals of a constant function. Focusing on the case where the derivator $g$ has finitely many discontinuities,…

We study the function field analogue of Shanks bias. For Liouville function $\lambda(f)$, we compare the number of monic polynomials $f$ with $\lambda(f) \chi_m(f) = 1$ and $\lambda(f) \chi_m(f) = -1$ for a nontrivial quadratic character…

The aim of this paper is to give an effective version of the Strong Artin Approximation Theorem for binomial equations. First we give an effective version of the Greenberg Approximation Theorem for polynomial equations, then using the…

We establish a necessary and sufficient condition for the differentiability of the distance function generated by a nonempty closed set K in a real normed linear space X under a proximinality condition on K. We do not assume the uniform…

We consider a uniqueness problem concerning the Fourier coefficients of normalized Cauchy transforms. These problems inherently involve proving a simultaneous approximation phenomenon and establishing the existence of cyclic inner functions…

We obtain the strong asymptotics of multiple orthogonal polynomials which arise in a mixed type Hermite-Pad\'e approximation problem defined on a Nikishin system of functions. The results obtained allow to give exact estimates of the rate…

In this paper, we prove power-saving bounds for the corelation of the M\"obius function with polynomial phases of degree $k$ in function fields $\mathbb{F}_p[t]$, when $p > k$. The proof relies on a new approximation result for phases of…

A combination of direct and inverse Fourier transforms on the unitary group $U(N)$ identifies normalized characters with probability measures on $N$-tuples of integers. We develop the $N\to\infty$ version of this correspondence by matching…

Consider random polynomials of the form $G_n = \sum_{i=0}^n \xi_i p_i$, where the $\xi_i$ are i.i.d.\ non-degenerate complex random variables, and $\{p_i\}$ is a sequence of orthonormal polynomials with respect to a regular measure $\tau$…

Given a weakly almost additive sequence of continuous functions with bounded variation $\mathcal{F}=\{\log f_n\}_{n=1}^{\infty}$ on a subshift $X$ over finitely many symbols, we study properties of a function $f$ on $X$ such that…

We introduce a strategy to tackle some known obstructions of current approaches to the Fourier uniformity conjecture. Assuming GRH, we then show the conjecture holds for intervals of length at least $(\log X)^{\psi(X)}$, with $\psi(X)…