Related papers: Optimal polynomial approximants and orthogonal pol…

We derive raising and lowering operators for orthogonal polynomials on the unit circle and find second order differential and $q$-difference equations for these polynomials. A general functional equation is found which allows one to relate…

Let $E$ be a closed subset of the unit circle of measure zero. Recently, Beise and M\"uller showed the existence of a function in the Hardy space $H^2$ for which the partial sums of its Taylor series approximate any continuous function on…

For a given polynomial $P$ with simple zeros, and a given semiclassical weight $w$, we present a construction that yields a linear second-order differential equation (ODE), and in consequence, an electrostatic model for zeros of $P$. The…

Rational function approximations find applications in many areas including macro-modeling of high-frequency circuits, model order reduction for controller design, interpolation and extrapolation of system responses, surrogate models for…

In a companion paper [On semiclassical orthogonal polynomials via polynomial mappings, J. Math. Anal. Appl. (2017)] we proved that the semiclassical class of orthogonal polynomials is stable under polynomial transformations. In this work we…

We study the $P_1$ finite element approximation of the best constant in the classical Hardy inequality over bounded domains containing the origin in $\mathbb{R}^N$, for $N \geq 3$. Despite the fact that this constant is not attained in the…

Let $\Omega$ be a regular Koenigs domain in the complex plane $\mathbb{C}$. We prove that the Hardy number of $\Omega$ is greater or equal to $1/2$. That is, every holomorphic function in the unit disc $f \colon \mathbb{D} \to \Omega$…

Spectral approximation by polynomials on the unit ball is studied in the frame of the Sobolev spaces $W^{s}_p(\ball)$, $1<p<\infty$. The main results give sharp estimates on the order of approximation by polynomials in the Sobolev spaces…

This is a survey on best polynomial approximation on the unit sphere and the unit ball. The central problem is to describe the approximation behavior of a function by polynomials via smoothness of the function. A major effort is to identify…

We obtain an estimate for uniform approximation rate of bounded analytic in the unit disk functions by logarithmic derivatives of $C$-polynomials, i.e., polynomials, all of whose zeros lie on the unit circle $C:|z|=1$.

We estimate the number of zeros of a polynomial in $\mathbb{C}[z]$ within any small circular disc centered on the unit circle, which improves and comprehensively extends a result established by Borwein, Erd{\'e}lyi, and Littmann~\cite{BE1}…

We prove that a bounded linear Hilbert space operator has the unit circle in its essential approximate point spectrum if and only if it admits an orbit satisfying certain orthogonality and almost-orthogonality relations. This result is…

For a given second order elliptic operation $\mathcal{L}$ in a domain $\Omega\subset{\mathbb{R}}^\mathbf{N}$, $\mathbf{N}\ $, and a compact set $\mathbf{K}\subset\Omega$, order $\mathbf{N}$-$2$-Ahlfors-David regular, we define the space…

The optimal Orlicz target space is exhibited for embeddings of fractional-order Orlicz-Sobolev spaces in $\mathbb R^n$. An improved embedding with an Orlicz-Lorentz target space, which is optimal in the broader class of all…

We construct bivariate orthogonal polynomials (OPs) on algebraic curves of the form $y^m = \phi(x)$ in $\mathbb{R}^2$ where $m = 1, 2$ and $\phi$ is a polynomial of arbitrary degree $d$, in terms of univariate semiclassical OPs. We compute…

In this paper we study the local zero behavior of orthogonal polynomials around an algebraic singularity, that is, when the measure of orthogonality is supported on $ [-1,1] $ and behaves like $ h(x)|x - x_0|^\lambda dx $ for some $ x_0 \in…

We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…

We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A $(2+\epsilon)$-approximation for all-pairs shortest paths in $O(\log^2{n} / \epsilon)$ rounds on unweighted…

We give estimates for the approximation numbers of composition operators on $H^2$, in terms of some modulus of continuity. For symbols whose image is contained in a polygon, we get that these approximation numbers are dominated by $\e^{- c…

We introduce sufficient conditions on discrete singular integral operators for their maximal truncations to satisfy a sparse bound. The latter imply a range of quantitative weighted inequalities, which are new. As an application, we prove…