Related papers: On Nash approximation of complex analytic sets in …
Let $X$ be an algebraic variety defined over a field of characteristic zero, and let $\xi \in \mathrm{\underline{Max}\; mult}(X)$ be a point in the closed subset of maximum multiplicity of $X$. We provide a criterion, given in terms of…
In this short note we give some corollaries of the polynomial inverse function theorem for large fields. We prove inverse and implicit function theorems for Nash maps over large fields, characterize large fields as fields satisfying inverse…
Let (e_i) be a dictionary for a separable Banach space X. We consider the problem of approximation by linear combinations of dictionary elements with quantized coefficients drawn usually from a `finite alphabet'. We investigate several…
We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…
A new subspace of Morrey spaces whose elements can be approximated by infinitely differentiable compactly supported functions is introduced. Consequently, we give an explicit description of the closure of the set of such functions in Morrey…
We give necessary and sufficient topological conditions for a simple closed curve on a real rational surface to be approximable by smooth rational curves. We also study approximation by smooth rational curves with given complex…
Given a system of functions f = (f1, . . . , fd) analytic on a neighborhood of some compact subset E of the complex plane, we give necessary and sufficient conditions for the convergence with geometric rate of the common denominators of…
We design a distributed algorithm to seek generalized Nash equilibria of a robust game with uncertain coupled constraints. Due to the uncertainty of parameters in set constraints, we aim to find a generalized Nash equilibrium in the worst…
Sparse approximations using highly over-complete dictionaries is a state-of-the-art tool for many imaging applications including denoising, super-resolution, compressive sensing, light-field analysis, and object recognition. Unfortunately,…
The classical theorem of Bishop-Phelps asserts that, for a Banach space X, the norm-achieving functionals in X* are dense in X*. Bela Bollobas's extension of the theorem gives a quantitative description of just how dense the norm-achieving…
In multistage perfect matching problems we are given a sequence of graphs on the same vertex set and asked to find a sequence of perfect matchings, corresponding to the sequence of graphs, such that consecutive matchings are as similar as…
We characterize the uniform limits of Dirichlet polynomials on a right half plane. In the Dirichlet setting, we find approximation results, with respect to the Euclidean distance and {to} the chordal one as well, analogous to classical…
We establish a necessary and sufficient condition for the differentiability of the distance function generated by a nonempty closed set K in a real normed linear space X under a proximinality condition on K. We do not assume the uniform…
Shearlet systems have so far been only considered as a means to analyze $L^2$-functions defined on $\R^2$, which exhibit curvilinear singularities. However, in applications such as image processing or numerical solvers of partial…
Approximation of entire functions by their pad\'e approximants has been examined in the past. It is true that generically such an approximation holds. However, examining this problem from another viewpoint, we obtain stronger generic…
Let $D_j\subset\Bbb C^{k_j}$ be a pseudoconvex domain and let $A_j\subset D_j$ be a locally pluripolar set, $j=1,...,N$. Put$$X:=\bigcup_{j=1}^N A_1\times...\times A_{j-1}\times D_j\times A_{j+1}\times...\times A_N\subset\Bbb…
Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…
The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows: Let $D=\{x_1,x_2,\ldots x_d\}$ be a set of $d$ words defined on an alphabet…
We study the generic behavior of the method of successive approximations for set-valued mappings in Banach spaces. We consider, in particular, the case of those set-valued mappings which are defined by pairs of nonexpansive mappings and…
We analyse the convergence of sampling algorithms for functions in reproducing kernel Hilbert spaces (RKHS). To this end, we discuss approximation properties of kernel regression under minimalistic assumptions on both the kernel and the…