Related papers: Some problems on optimal approximants

We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specified graphs, many of which are PSPACE-complete. Assuming P != PSPACE, the existence or nonexistence of such efficient…

This thesis explores algorithmic applications and limitations of convex relaxation hierarchies for approximating some discrete and continuous optimization problems. - We show a dichotomy of approximability of constraint satisfaction…

A problem list in singularity theory. Most of these problems are related with the algorithmic enumeration of possible topological types of non-discriminant Morsifications of real function singularities, and/or with the Picard--Lefschetz…

This work studies optimal polynomial approximants (OPAs) in the classical Hardy spaces on the unit disk, $H^p$ ($1 < p < \infty$). In particular, we uncover some estimates concerning the OPAs of degree zero and one. It is also shown that if…

We consider various inequalities for polynomials, with an emphasis on the most fundamental inequalities of approximation theory. In the sequel a key role is played by the generalized Minkowski functional \alpha(K,x), already being used by…

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…

In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…

Extending earlier results of the authors on minimal polynomials of $p$-elements of finite groups of Lie type in cross-characteristic representations, this paper focuses on the case where Sylow $p$-subgroups are cyclic and $p$ is distinct…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

We present some open problems and obtain some partial results for spectral optimization problems involving measure, torsional rigidity and first Dirichlet eigenvalue.

This is a very brief report on recent developments on the Dirichlet problem for the minimal surface system and minimal cones in Euclidean spaces. We shall mainly focus on two directions: (1) Further systematic developments after…

Computing an optimal cycle in a given homology class, also referred to as the homology localization problem, is known to be an NP-hard problem in general. Furthermore, there is currently no known optimality criterion that localizes classes…

We prove some sufficient conditions implying $l^p$ inequalities of the form $||x||_p \leq ||y||_p$ for vectors $ x, y \in [0,\infty)^n$ and for $p$ in certain positive real intervals. Our sufficient conditions are strictly weaker than the…

We establish generalizations of the Nyman-Beurling and B\'aez-Duarte criteria concerning lack of zeros of Dirichlet $L$-functions in the semi-plane $\Re(s) >1/p$ for $p\in (1,2]$. We pose and solve a natural extremal problem for Dirichlet…

In approximation theory, logarithmic derivatives of complex polynomials are called simple partial fractions (SPF) as suggested by Eu.P. Dolzhenko. Many solved and unsolved extremal problems related to SPF are traced back to works of G.…

We characterize polynomials that are cyclic in Dirichlet-type spaces in the unit ball in $\mathbb C^2$

For compact domains with smooth boundaries, we present an approximation scheme for surface spline approximation that delivers precise $L_p$ approximation orders on well known smoothness spaces. This scheme overcomes the boundary effects…

In this paper, we revisit approximation properties of piecewise polynomial spaces, which contain more than ${\cal P}_{r-1}$ but not ${\cal P}_r$. We develop more accurate upper and lower error bounds that are sharper than those used in…

For a family of second-order elliptic systems in divergence form with rapidly oscillating almost-periodic coefficients, we obtain estimates for approximate correctors in terms of a function that quantifies the almost periodicity of the…

In the first part of this expository paper, we present and discuss the interplay of Dirichlet polynomials in some classical problems of number theory, notably the Lindel\"of Hypothesis. We review some typical properties of their means and…