Related papers: On Nash approximation of complex analytic sets in …

We prove that the subsets of N^d that are S-recognizable for all abstract numeration systems S are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in the one-dimensional setting.

The purpose of this article is to develop a machinery to study the capacity of deep neural networks (DNNs) to approximate high-dimensional functions. In particular, we show that DNNs have the expressive power to overcome the curse of…

Over the past a few years, research and development has made significant progresses on big data analytics. A fundamental issue for big data analytics is the efficiency. If the optimal solution is unable to attain or not required or has a…

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

Let $G$ be a group with a metric $\mathrm{d}$ invariant under left and right translations, and let $\bar{\mathbb{D}}_r$ be the ball of radius $r$ around the identity. A $(k,r)$-metric approximate subgroup is a symmetric subset $X$ of $G$…

In this paper we develop a new machinery to study the capacity of artificial neural networks (ANNs) to approximate high-dimensional functions without suffering from the curse of dimensionality. Specifically, we introduce a concept which we…

Let $U\subseteq\mathbb{R}^{n}$ be open and convex. We show that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we…

We show that if $x$ is a strongly extreme point of a bounded closed convex subset of a Banach space and the identity has a geometrically and topologically good enough local approximation at $x$, then $x$ is already a denting point. It turns…

We give necessary and sufficient conditions for the convergence with geometric rate of the denominators of linear Pad\'e-orthogonal approximants corresponding to a measure supported on a general compact set in the complex plane. Thereby, we…

Erd\H{o}s \cite{MR168482} proved that the Continuum Hypothesis (CH) is equivalent to the existence of an uncountable family $\mathcal{F}$ of (real or complex) analytic functions, such that $\big\{ f(x) \ : \ f \in \mathcal{F} \big\}$ is…

We introduce a class of analytic sheaves in a Banach space X, that we call cohesive sheaves. Cohesion is meant to generalize the notion of coherence from finite dimensional analysis. Accordingly, we prove the analog of Cartan's Theorems A…

The main result is that, for any projective compact analytic subset A of dimension q>0 in a reduced complex space X, there is a neighborhood U of A such that, for any covering space Z of X in which the lifting B of A has no noncompact…

Given a semianalytic set S in a complex space and a point p in S, there is a unique smallest complex-analytic germ at p which contains the germ of S, called the holomorphic closure of S at p. We show that if S is semialgebraic then its…

Let $U\subseteq\mathbb{R}^d$ be open and convex. We prove that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. We also show…

Artificial neural networks (ANNs) have become a very powerful tool in the approximation of high-dimensional functions. Especially, deep ANNs, consisting of a large number of hidden layers, have been very successfully used in a series of…

We study complexes of finite complete intersection dimension in the derived category of a local ring. Given such a complex, we prove that the thick subcategory it generates contains complexes of all possible complexities. In particular, we…

In relational approach to general rough sets, ideas of directed relations are supplemented with additional conditions for multiple algebraic approaches in this research paper. The relations are also specialized to representations of general…

Let $X$ be a separable Banach space with a separating polynomial. We show that there exists $C\geq 1$ (depending only on $X$) such that for every Lipschitz function $f:X\rightarrow\mathbb{R}$, and every $\epsilon>0$, there exists a…

This paper presents a general closed graph property for (randomized strategy) Nash equilibrium correspondence in large games. In particular, we show that for any large game with a convergent sequence of fiinite-player games, the limit of…

We consider the problem of under and over-approximating the image of general vector-valued functions over bounded sets, and apply the proposed solution to the estimation of reachable sets of uncertain non-linear discrete-time dynamical…