Related papers: Differentiable approximation of continuous semialg…

This paper presents a novel multi-scale method for elliptic partial differential equations with arbitrarily rough coefficients. In the spirit of numerical homogenization, the method constructs problem-adapted ansatz spaces with uniform…

Based on Smirnov's decomposition theorem we prove that every rectifiable $1$-current $T$ with finite mass $\mathbb{M}(T)$ and finite mass $\mathbb{M}(\partial T)$ of its boundary $\partial T$ can be approximated in mass by a sequence of…

We present a geometric proof of the theorem saying that holomorphic maps from Runge domains to affine algebraic varieties admit approximation by Nash maps. Next we generalize this theorem.

We describe inexact proximal Newton-like methods for solving degenerate regularized optimization problems and for the broader problem of finding a zero of a generalized equation that is the sum of a continuous map and a maximal monotone…

This article is concerned with the problem of approximating a not necessarily bounded spectrahedral shadow, a certain convex set, by polyhedra. By identifying the set with its homogenization the problem is reduced to the approximation of a…

Given sufficiently many components, it is often cited that finite mixture models can approximate any other probability density function (pdf) to an arbitrary degree of accuracy. Unfortunately, the nature of this approximation result is…

We define the notion of {\em rational presentation of a complete metric space} in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some presentations of the space $\czu$ of uniformly…

Let $\k$ be a characteristic zero PID, $S$ be a $\k$-algebra and $T\subseteq S$ be a full rank subalgebra. Suppose the algebra $T$ is symmetric. It is important to know when $T$ is a {\em maximal symmetric subalgebra} of $S$, i.e. no…

We investigate the completeness and completions of the normed algebras $D^{(1)}(X)$ for perfect, compact plane sets $X$. In particular, we construct a radially self-absorbing, compact plane set $X$ such that the normed algebra $D^{(1)}(X)$…

We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is…

We consider a fast approximation method for a solution of a certain stochastic non-local pseudodifferential equation. This equation defines a Mat\'ern class random field. The approximation method is based on the spectral compactness of the…

For a function $f$, continuous on a compact convex set $K$ and analytic in its interior we construct a sequence of almost optimal polynomials that converge with a geometric rate at points of analyticity of $f$.

We prove some results on when functions on compact sets $K \subset \mathbb C$ can be approximated by polynomials avoiding values in given sets. We also prove some higher dimensional analogues. In particular we prove that a continuous…

Associated to any closed quantum subgroup $G\subset U_N^+$ and any index set $I\subset\{1,\ldots,N\}$ is a certain homogeneous space $X_{G,I}\subset S^{N-1}_{\mathbb C,+}$, called affine homogeneous space. We discuss here the abstract…

Let $G$ be a compact Lie group. We prove that if $V$ and $W$ are orthogonal $G$-representations such that $V^G=W^G=\{0\}$, then a $G$-equivariant map $S(V) \to S(W)$ exists provided that $\dim V^H \leq \dim W^H$ for any closed subgroup…

The well-known Reifenberg theorem states that if a subset of $\mathbb{R}^n$ can be well approximated by $k$-planes at every point and every scale, then it is biH\"older homeomorphic to a $k$-disk. This article concerns a subset $S$ of…

We study the approximation of J-holomorphic maps continuous to the boundary from ma domain in the complex plane into an almost complex manifold by maps J-holomorphic to the boundary, giving partial results in the non-integrable case. For…

This paper studies clustering algorithms for dynamically evolving graphs $\{G_t\}$, in which new edges (and potential new vertices) are added into a graph, and the underlying cluster structure of the graph can gradually change. The paper…

It is known that exactness for a discrete group is equivalent to C*-exactness, i.e., the exactness of its reduced C*-algebra. The problem of whether this equivalence holds for general locally compact groups has recently been reduced by Cave…

This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…