English
Related papers

Related papers: Boundary behavior of optimal polynomial approximan…

200 papers

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

Data Structures and Algorithms · Computer Science 2016-11-18 Josh Alman , Ryan Williams

For $0<p \leq \infty$, let $H^p$ denote the classical Hardy space of the unit disc. We consider the extremal problem of maximizing the modulus of the $k$th Taylor coefficient of a function $f \in H^p$ which satisfies $\|f\|_{H^p}\leq1$ and…

Complex Variables · Mathematics 2023-11-02 Ole Fredrik Brevig , Sigrid Grepstad , Sarah May Instanes

On the sets of $2\pi$-periodic functions $f$, which are defined with a help of $(\psi, \beta)$-integrals of the functions $\varphi$ from $L_{1}$, we establish Lebesgue-type inequalities, in which the uniform norms of deviations of Fourier…

Classical Analysis and ODEs · Mathematics 2023-01-06 Anatoly Serdyuk , Tetiana Stepaniuk

We obtain the asymptotic equalities for the least upper bounds of approximations by interpolation trigonometric polynomials with the equidistant nodes $x_k^{(n-1)}=\frac{2k\pi}{2n-1},\ k\in\mathbb{Z},$ in metrics of the spaces $L_p$ on…

Classical Analysis and ODEs · Mathematics 2018-06-08 A. S. Serdyuk , I. V. Sokolenko

We obtain sharp bounds for the modulus of continuity of the uncentered maximal function in terms of the modulus of continuity of the given function, via integral formulas. Some of the results deduced from these formulas are the following:…

Classical Analysis and ODEs · Mathematics 2010-09-08 J. M. Aldaz , L. Colzani , J. Pérez Lázaro

It has been recently shown that $|| F_n(A) ||\leq 2$, where $A$ is a linear continuous operator acting in a Hilbert space, and $F_n$ is the Faber polynomial of degree $n$ corresponding to some convex compact $E\subset \mathbb C$ containing…

Numerical Analysis · Mathematics 2013-10-07 Bernhard Beckermann , Michel Crouzeix

We investigate a way to approximate the maximum of a polynomial over a polytopal region by using Handelman's polynomial decomposition and continuous multivariate generating functions. The maximization problem is NP-hard, but our…

Optimization and Control · Mathematics 2016-06-28 Jesús De Loera , Brandon Dutra , Matthias Köppe

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

alg-geom · Mathematics 2008-02-03 Martin Sombra

There exist well-known tight bounds on the error between a function $f \in C^{\,n + 1}([-1, 1])$ and its best polynomial approximation of degree $n$. We show that the error meets these bounds when and only when $f$ is a polynomial of degree…

Classical Analysis and ODEs · Mathematics 2020-01-06 Patrick Kidger

Let $\Omega$ be a bounded pseudoconvex domain in $\mathbb{C}^N$. Given a continuous plurisubharmonic function $u$ on $\Omega$, we construct a sequence of Gaussian analytic functions $f_n$ on $\Omega$ associated with $u$ such that…

Complex Variables · Mathematics 2025-03-21 Kiyoon Eum

Let f be a germ of an analytic function at infinity that can be analytically continued along any path in the complex plane deprived of a finite set of points, f \in\mathcal{A}(\bar{\C} \setminus A), \sharp A <\infty. J. Nuttall has put…

Classical Analysis and ODEs · Mathematics 2016-01-12 Alexander I. Aptekarev , Maxim L. Yattselev

Galluccio--Loebl and Tesler showed that the perfect-matching polynomial of a graph embedded in an orientable surface of genus $g$ can be written as a linear combination of at most $4^g$ Pfaffians. We show that, in general, exponentially…

Combinatorics · Mathematics 2026-05-21 Priyanshu Pant , Ranveer Singh

Lasserre [La] proved that for every compact set $K\subset\mathbb R^n$ and every even number $d$ there exists a unique homogeneous polynomial $g_0$ of degree $d$ with $K\subset G_1(g_0)=\{x\in\mathbb R^n:g_0(x)\leq 1\}$ minimizing $|G_1(g)|$…

Functional Analysis · Mathematics 2021-07-26 David Alonso-Gutiérrez , Bernardo González Merino , Rafael Villa

We established exact in order estimates an approximation of the Sobolev classes $W^{\boldsymbol{r}}_{p,\boldsymbol{\alpha}}(\mathbb{T}^d)$ of periodic functions of many variables with a bounded dominating mixed derivative. The approximation…

Classical Analysis and ODEs · Mathematics 2024-10-17 K. V. Pozharska , A. S. Romanyuk , S. Ya. Yanchenko

Assume that $V_h$ is a space of piecewise polynomials of degree less than $r\geq 1$ on a family of quasi-uniform triangulation of size $h$. Then the following well-known upper bound holds for a sufficiently smooth function $u$ and $p\in [1,…

Numerical Analysis · Mathematics 2011-06-23 Qun Lin , Hehu Xie , Jinchao Xu

For a function $f$ that is piecewise analytic on a quasi-smooth arc $\mathcal{L}$ and any $0<\sigma<1$ we construct a sequence of "near-best" polynomials that converge at a rate $e^{-n^{\sigma}}$ at each point of analyticity of $f$ and are…

Complex Variables · Mathematics 2021-02-04 Liudmyla Kryvonos

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…

Classical Analysis and ODEs · Mathematics 2016-02-17 Yurii Kolomoitsev , Tetiana Lomako , Jürgen Prestin

We define the quantile set of order $\alpha \in \left[ 1/2,1\right) $ associated to a law $P$ on $\mathbb{R}^{d}$ to be the collection of its directional quantiles seen from an observer $O\in \mathbb{R}^{d}$. Under minimal assumptions these…

Statistics Theory · Mathematics 2016-12-06 Adil Ahidar-Coutrix , Philippe Berthet

The approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within error $1/3$ in the $\ell_\infty$ norm. In an influential result, Aaronson and Shi (J. ACM…

Computational Complexity · Computer Science 2015-03-27 Mark Bun , Justin Thaler

We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…

Optimization and Control · Mathematics 2021-12-06 Ankit Garg , Robin Kothari , Praneeth Netrapalli , Suhail Sherif