Related papers: On the best coapproximation problem in $\ell_1^n$

We provide two derivations of the baryonic equations that can be straightforwardly implemented in existing Einstein--Boltzmann solvers. One of the derivations begins with an action principle, while the other exploits the conservation of the…

A Banach space contains either a minimal subspace or a continuum of incomparable subspaces. General structure results for analytic equivalence relations are applied in the context of Banach spaces to show that if $E_0$ does not reduce to…

We study the space $c_{0,\mathcal{I}}$ of all bounded sequences $(x_n)$ that $\mathcal{I}$-converge to $0$, endowed with the sup norm, where $\mathcal{I}$ is an ideal of subsets of $\mathbb{N}$. We show that two such spaces,…

In the classic maximum coverage problem, we are given subsets $T_1, \dots, T_m$ of a universe $[n]$ along with an integer $k$ and the objective is to find a subset $S \subseteq [m]$ of size $k$ that maximizes $C(S) := |\cup_{i \in S} T_i|$.…

We prove a new quantitative result on the degeneracy of the dimension of the subspace spanned by the best Diophantine approximations for a linear form.

Bernstein polynomial approximation to a continuous function has a slower rate of convergence as compared to other approximation methods. "The fact seems to have precluded any numerical application of Bernstein polynomials from having been…

Let $X$ be a compact metric space, $C(X)$ be the space of continuous real-valued functions on $X$, and $A_1$, $A_2$ be two closed subalgebras of $C(X)$ containing constant functions. We consider the problem of approximation of a function…

We study uniqueness of best approximation in Orlicz spaces L$\Phi$, for different types of convex functions $\Phi$ and for some finite dimensional approximation classes of functions, where Tchebycheff spaces, and more general approximation…

We consider the problem of approximating a smooth function from finitely-many pointwise samples using $\ell^1$ minimization techniques. In the first part of this paper, we introduce an infinite-dimensional approach to this problem. Three…

Let $E_n(f)_\mu$ be the error of best approximation by polynomials of degree at most $n$ in the space $L^2(\varpi_\mu, \mathbb{B}^d)$, where $\mathbb{B}^d$ is the unit ball in $\mathbb{R}^d$ and $\varpi_\mu(x) = (1-\|x\|^2)^\mu$ for $\mu >…

We prove a fixed point theorem for a family of Banach spaces, notably L^1 and its non-commutative analogues. Several applications are given, e.g. the optimal solution to the "derivation problem" studied since the 1960s.

We construct a class of minimal trees and use these trees to establish a number of coloring theorems on general trees. Among the applications of these trees and coloring theorems are quantification of the Bourgain $\ell_p$ and $c_0$…

Oblivious low-distortion subspace embeddings are a crucial building block for numerical linear algebra problems. We show for any real $p, 1 \leq p < \infty$, given a matrix $M \in \mathbb{R}^{n \times d}$ with $n \gg d$, with constant…

Motivated by Rosenthal's famous $l^1$-dichotomy in Banach spaces, Haydon's theorem, and additionally by recent works on tame dynamical systems, we introduce the class of tame locally convex spaces. This is a natural locally convex analogue…

In this paper, we consider a condition on subspaces in order to improve bounds given in the Bernstein's Lethargy Theorem (BLT) for Banach spaces. Let $d_1 \geq d_2 \geq \dots d_n \geq \dots > 0$ be an infinite sequence of numbers converging…

Let $E_n(f)_{\alpha,\beta,\gamma}$ denote the error of best approximation by polynomials of degree at most $n$ in the space $L^2(\varpi_{\alpha,\beta,\gamma})$ on the triangle $\{(x,y): x, y \ge 0, x+y \le 1\}$, where…

Many statistical models seek relationship between variables via subspaces of reduced dimensions. For instance, in factor models, variables are roughly distributed around a low dimensional subspace determined by the loading matrix; in mixed…

This work proposes and analyzes a compressed sensing approach to polynomial approximation of complex-valued functions in high dimensions. Of particular interest is the setting where the target function is smooth, characterized by a rapidly…

It is shown in this note that one can decide whether an $n$-dimensional subspace of $\ell_\infty^N$ is isometrically isomorphic to $\ell_\infty^n$ by testing a finite number of determinental inequalities. As a byproduct, an elementary proof…

We obtain a necessary and sufficient condition for a matrix $A$ to be Birkhoff-James orthogonal to any subspace $\mathscr W$ of $\mathbb M_n(\mathbb C)$. Using this we obtain an expression for the distance of $A$ from any unital $C^*$…