English
Related papers

Related papers: On the Best Uniform Polynomial Approximation to th…

200 papers

Let $E\subset \mathbb{R}^{n+1}$, $n\ge 2$, be a uniformly rectifiable set of dimension $n$. Then bounded harmonic functions in $\Omega:= \mathbb{R}^{n+1}\setminus E$ satisfy Carleson measure estimates, and are "$\varepsilon$-approximable".…

Analysis of PDEs · Mathematics 2016-09-07 Steve Hofmann , Jose Maria Martell , Svitlana Mayboroda

Approximating a univariate function on the interval $[-1,1]$ with a polynomial is among the most classical problems in numerical analysis. When the function evaluations come with noise, a least-squares fit is known to reduce the effect of…

Numerical Analysis · Mathematics 2025-07-08 Takeru Matsuda , Yuji Nakatsukasa

We study the error in approximating the minimum of a Brownian motion on the unit interval based on finitely many point evaluations. We construct an algorithm that adaptively chooses the points at which to evaluate the Brownian path. In…

Probability · Mathematics 2016-01-07 James M. Calvin , Mario Hefter , André Herzwurm

The polynomial $f_{2n}(x)=1+x+\cdots+x^{2n}$ and its minimizer on the real line $x_{2n}=\operatorname{arg\,inf} f_{2n}(x)$ for $n\in\Bbb N$ are studied. Results show that $x_{2n}$ exists, is unique, corresponds to $\partial_x f_{2n}(x)=0$,…

History and Overview · Mathematics 2021-09-16 Aaron Hendrickson , Claude F. Leibovici

In this paper, we study the tradeoff between the approximation guarantee and adaptivity for the problem of maximizing a monotone submodular function subject to a cardinality constraint. The adaptivity of an algorithm is the number of…

Data Structures and Algorithms · Computer Science 2018-11-01 Alina Ene , Huy L. Nguyen

We explore the connection between two seemingly distant fields: the set of cyclic functions $f$ in a Hilbert space of analytic functions over the unit disc $\D$, on the one hand, and the families of orthogonal polynomials for a weight on…

Classical Analysis and ODEs · Mathematics 2025-07-22 Ramón Orive , Joaquín Sánchez-Lara , Daniel Seco

We consider the energy norm arising from elliptic problems with discontinuous piecewise constant diffusion. We prove that under the quasi-monotonicity property on the diffusion coefficient, the best approximation error with continuous…

Numerical Analysis · Mathematics 2021-05-18 Francesca Tantardini , Rüdiger Verfürth

In this paper, among other things, we show that, given $r\in N$, there is a constant $c=c(r)$ such that if $f\in C^r[-1,1]$ is convex, then there is a number ${\mathcal N}={\mathcal N}(f,r)$, depending on $f$ and $r$, such that for…

Classical Analysis and ODEs · Mathematics 2018-11-06 Kirill A. Kopotun , Dany Leviatan , Igor A. Shevchuk

Suppose $X$ is a uniformly distributed $n$-dimensional binary vector and $Y$ is obtained by passing $X$ through a binary symmetric channel with crossover probability $\alpha$. A recent conjecture by Courtade and Kumar postulates that…

Information Theory · Computer Science 2015-06-02 Or Ordentlich , Ofer Shayevitz , Omri Weinstein

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

Algebraic Geometry · Mathematics 2010-11-09 Philippe Pebay , J. Maurice Rojas , David C. Thompson

The $\epsilon$-approximate degree $deg_\epsilon(f)$ of a Boolean function $f$ is the least degree of a real-valued polynomial that approximates $f$ pointwise to error $\epsilon$. The approximate degree of $f$ is at least $k$ iff there…

Computational Complexity · Computer Science 2019-06-04 Andrej Bogdanov , Nikhil S. Mande , Justin Thaler , Christopher Williamson

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let…

Optimization and Control · Mathematics 2023-01-24 Ngoc Hoang Anh Mai

We prove a multivariate Whitney type theorem for the local anisotropic polynomial approximation in $L_p(Q)$ with $1\leq p\leq \infty$. Here $Q$ is a $d$-parallelepiped in $\RR^d$ with sides parallel to the coordinate axes. We consider the…

Functional Analysis · Mathematics 2010-09-30 D. Dinh , T. Ullrich

In this paper, we prove the equidistribution of periodic points of a regular polynomial automorphism f : A^n -> A^n defined over a number field K: let f be a regular polynomial automorphism defined over a number field K and let v be a prime…

Number Theory · Mathematics 2012-03-08 Chong Gyu Lee

Given a set $P$ of points and a set $U$ of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of $P$ with $U$ is a subset of $U$ that covers $P$ and minimizes the number of squares that share a common intersection,…

Computational Geometry · Computer Science 2022-08-15 Stephane Durocher , J. Mark Keil , Debajyoti Mondal

We describe a method for approximating a single-variable function $f$ using persistence diagrams of sublevel sets of $f$ from height functions in different directions. We provide algorithms for the piecewise linear case and for the smooth…

Algebraic Topology · Mathematics 2023-02-10 Aina Ferrà , Carles Casacuberta , Oriol Pujol

We investigate lower bounds for the variance in arithmetic progressions of certain multiplicative functions "close" to $1$. Specifically, we consider $\alpha_N$-fold divisor functions, when $\alpha_N$ is a sequence of positive real numbers…

Number Theory · Mathematics 2021-02-23 Daniele Mastrostefano

We consider the problem of reconstructing an unknown function $f$ on a domain $X$ from samples of $f$ at $n$ randomly chosen points with respect to a given measure $\rho_X$. Given a sequence of linear spaces $(V_m)_{m>0}$ with ${\rm…

Numerical Analysis · Mathematics 2018-06-19 Albert Cohen , Mark A. Davenport , Dany Leviatan

The asymptotic expansion of the Touchard polynomials $T_n(z)$ (also known as the exponential polynomials) for large $n$ and complex values of the variable $z$, where $|z|$ may be finite or allowed to be large like $O(n)$, has been recently…

Classical Analysis and ODEs · Mathematics 2016-06-29 R B Paris