相关论文: Polynomial approximation in $L_p(R, d\mu)$. I

We show that solutions to Krein systems, the continuous frequency analogue of orthogonal polynomials on the unit circle, generated by an $A_2 (\mathbb{R})$ weight $w$ satisfying $w-1 \in L^1 (\mathbb{R}) + L^2 (\mathbb{R})$, are uniformly…

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…

Generalizations of some known results on the best, best linear and best one-sided approxima- tions by trigonometric polynomials of the classes of 2\pi - periodic functions presented in the form of convolutions to the case of set-valued…

In this paper we mainly discuss three things. First, there is no canonical norm on the space $H^p_u(\mathbb{D})$. Second, we improve the weak-$*$ convergence of the measures $\mu_{u,r}$. Third, the dilations $f_t$ of the function $f\in…

The main purpose of this paper is to prove some density results of polynomials in Fock spaces of slice regular functions. The spaces can be of two different kinds since they are equipped with different inner products and contain different…

For any $p\in[1,\infty)$, we prove that the set of simple functions taking at most $k$ different values is proximinal in B\"ochner spaces $L^p(X)$ whenever $X$ is a dual Banach space with $w^*$-sequentially compact unit ball. With…

We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…

In the case when the weight and its inverse belong to BMO(T), we prove the asymptotics of the monic orthogonal polynomials in L^p, 2<p<p_0. Immediate applications include the estimates on the uniform norm and asymptotics for the polynomial…

A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…

This paper offers a newly created integral approach for operators employing the orthogonal modified Laguerre polynomials and P\u{a}lt\u{a}nea basis. These operators approximate the functions over the interval $[0,\infty)$. Further, the…

We study best approximation to a given function, in the least square sense on a subset of the unit circle, by polynomials of given degree which are pointwise bounded on the complementary subset. We show that the solution to this problem, as…

Several new inequalities for moduli of smoothness and errors of the best approximation of a function and its derivatives in the spaces $L_p$, $0<p<1$, are obtained. For example, it is shown that for any $0<p<1$ and $k,\,r\in \mathbb{N}$ one…

In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…

We introduce polystar bodies: compact starshaped sets whose gauge or radial functions are expressible by polynomials, enabling tractable computations, such as that of intersection bodies. We prove that polystar bodies are uniformly dense in…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

We establish a relation between the approximation in $L^2[-\pi,\pi]$ by exponentials with the set of frequencies of Beurling--Malliavin density less than $1$ and the meromorphic interpolation at $\mathbb Z$. Furthermore, we show that…

We study here a sequence of secondary measures, so called because the set of secondary polynomials on a given term become orthogonal for the next measure. The main result is a formula making explicit the density of any term of the sequence,…