Related papers: Best polynomial approximation on the triangle

Motivated by recent work on optimal approximation by polynomials in the unit disk, we consider the following noncommutative approximation problem: for a polynomial $f$ in $d$ freely noncommuting arguments, find a free polynomial $p_n$, of…

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…

Let $\Gamma \subset \mathbb C$ be a curve of class $C(2,\alpha)$. For $z_{0}$ in the unbounded component of ${\mathbb C}\setminus \Gamma$, and for $n=1,2,...$, let $\nu_n$ be a probability measure with supp$(\nu_{n})\subset \Gamma$ which…

We determine which quadratic polynomials in three variables are expanders over an arbitrary field $\mathbb{F}$. More precisely, we prove that for a quadratic polynomial $f\in \mathbb{F}[x,y,z]$, which is not of the form $g(h(x)+k(y)+l(z))$,…

Let $\Gamma$ be a crystal group in $\mathbb R^d$. A function $\varphi:\mathbb R^d\longrightarrow \mathbb C$ is said to be {\em crystal-refinable} (or $\Gamma-$refinable) if it is a linear combination of finitely many of the rescaled and…

Given a multiset $X=\{x_1,..., x_n\}$ of real numbers, the {\it floating-point set summation} problem asks for $S_n=x_1+...+x_n$. Let $E^*_n$ denote the minimum worst-case error over all possible orderings of evaluating $S_n$. We prove that…

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

The $n$-grid $E_n$ consists of $n$ equally spaced points in $[-1,1]$ including the endpoints $\pm 1$. The extremal polynomial $p_n^*$ is the polynomial that maximizes the uniform norm $\| p \|_{[-1,1]}$ among polynomials $p$ of degree $\leq…

This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the $L^r$-Kantorovich (or transport) distance, where either the locations or the weights of the approximations' atoms are…

In this paper, we develop approximation error estimates as well as corresponding inverse inequalities for B-splines of maximum smoothness, where both the function to be approximated and the approximation error are measured in standard…

We resolve three interrelated problems on \emph{reduced Kronecker coefficients} $\overline{g}(\alpha,\beta,\gamma)$. First, we disprove the \emph{saturation property} which states that $\overline{g}(N\alpha,N\beta,N\gamma)>0$ implies…

Given a regular compact set $E$ in the complex plane, a unit measure $\mu$ supported by $\partial E,$ a triangular point set $\beta := \{\{\beta_{n,k}\}_{k=1}^n\}_{n=1}^{\infty},\beta\subset \partial E$ and a function $f$, holomorphic on…

A recent result of Eden, Levi, and Ron (ECCC 2015) provides a sublinear time algorithm to estimate the number of triangles in a graph. Given an undirected graph $G$, one can query the degree of a vertex, the existence of an edge between…

We establish an explicit link between depth-3 formulas and one-sided approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n)…

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $f \in \mathbb{F}_{q}[x]$ be a polynomial of degree $d > 0$. Denote the image set of this polynomial as $V_{f}=\{f(\alpha)\mid\alpha\in\mathbb{F}_{q}\}$ and denote the…

In the Densest $k$-Subgraph problem, given an undirected graph $G$ and an integer $k$, the goal is to find a subgraph of $G$ on $k$ vertices that contains maximum number of edges. Even though the state-of-the-art algorithm for the problem…

A new modulus of smoothness and its equivalent $K$-function are defined on the conic domains in $\mathbb{R}^d$, and used to characterize the weighted best approximation by polynomials. Both direct and weak inverse theorems of the…

A sharp explicit estimate is proved for the difference $e^\beta-\alpha$ when $\alpha$ and $\beta$ are nonzero algebraic numbers.

A sequence of real numbers $\{x_{n}\}_{n\in \mathbb{N}}$ is said to be $\alpha \beta$-statistically convergent of order $\gamma$ (where $0<\gamma\leq 1$) to a real number $x$ \cite{a} if for every $\delta>0,$ $$\underset{n\rightarrow…

If $f\!:\![a,b]\to\R$ such that $f^{(n)}$ is integrable then integration by parts gives the formula \begin{align*} &\intab f(x)\,dx = &\frac{(-1)^n}{n!}\sum_{k=0}^{n-1}(-1)^{n-k-1}\left[ \phi_n^{(n-k-1)}(a)f^{(k)}(a)-…