English
Related papers

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

200 papers

In this paper we show that reversible analysis of logic languages by abstract interpretation can be performed without loss of precision by systematically refining abstract domains. The idea is to include semantic structures into abstract…

Programming Languages · Computer Science 2007-05-23 R. Giacobazzi , F. Ranzato , F. Scozzari

We consider approximations of a continuous function on a countable normed Fr\'{e}chet space by analytic and $*$-analytic. Also we found a criterium of the existence of an extension of a continuous function from a dense subspace of a…

Functional Analysis · Mathematics 2015-05-01 M. A. Mytrofanov , A. V. Ravsky

We show that norms on certain Banach spaces $X$ can be approximated uniformly, and with arbitrary precision, on bounded subsets of $X$ by $C^{\infty}$ smooth norms and polyhedral norms. In particular, we show that this holds for any…

Functional Analysis · Mathematics 2022-06-22 Victor Bible , Richard J. Smith

Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical…

Systems and Control · Computer Science 2022-05-03 Sergiy Bogomolov , Marcelo Forets , Goran Frehse , Andreas Podelski , Christian Schilling , Frédéric Viry

We prove that the Nash problem holds for two-dimensional rational double points in all characteristics. The proof is based on a direct computation of the families of arcs through these singularities.

Algebraic Geometry · Mathematics 2025-08-19 Tommaso de Fernex , Shih-Hsin Wang

Let $X$ be a separable real Hilbert space. We show that for every Lipschitz function $f:X\rightarrow\mathbb{R}$, and for every $\epsilon>0$, there exists a Lipschitz, real analytic function $g:X\rightarrow\mathbb{R}$ such that…

Functional Analysis · Mathematics 2015-03-23 D. Azagra , R. Fry , L. Keener

In this paper, we obtained the strong convergence of Wong-Zakai approximations of reflected SDEs in a general multidimensional domain giving an affirmative answer to the question posed in [ES].

Probability · Mathematics 2013-04-25 Tusheng Zhang

Let $X$ be a reflexive Banach space. In this paper we give a necessary and sufficient condition for an operator $T\in \mathcal{K}(X)$ to have the best approximation in numerical radius from the convex subset $\mathcal{U} \subset…

Functional Analysis · Mathematics 2010-07-15 Asuman Guven Aksoy , Grzegorz Lewicki

We study the generic behavior of the method of successive approximations for set-valued mappings in separable Banach spaces. We consider the case of nonexpansive mappings with convex and compact point images and show that for the typical…

Functional Analysis · Mathematics 2023-01-27 Christian Bargetz , Emir Medjic , Katriin Pirk

It is proved for a strongly pseudoconvex domain $D$ in $\Bbb C^d$ with $\mathcal C^{2,\alpha}$-smooth boundary that any complex geodesic through every two close points of $D$ sufficiently close to $\partial D$ and whose difference is…

Complex Variables · Mathematics 2024-10-14 Łukasz Kosiński , Nikolai Nikolov

Approximation of real analytic functions by Nash functions is a classical topic in real geometry. In this paper, we focus on the Nash approximation of an analytic desingularization of a Nash function germ obtained by a sequence of…

Algebraic Geometry · Mathematics 2014-02-26 Goulwen Fichou , Masahiro Shiota

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$.

Complex Variables · Mathematics 2022-10-19 Liudmyla Kryvonos

We show that $C^0$-fine approximation of convex functions by smooth (or real analytic) convex functions on $\R^d$ is possible in general if and only if $d=1$. Nevertheless, for $d\geq 2$ we give a characterization of the class of convex…

Classical Analysis and ODEs · Mathematics 2012-01-24 Daniel Azagra

This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information. In particular, we prove that…

Computational Complexity · Computer Science 2022-12-28 John Bostanci , John Watrous

The capability of recurrent neural networks to approximate trajectories of a random dynamical system, with random inputs, on non-compact domains, and over an indefinite or infinite time horizon is considered. The main result states that…

Neural and Evolutionary Computing · Computer Science 2022-11-16 Adrian N. Bishop

The framework outlined in [arXiv:2010.13024] provides an approximation algorithm for computing Nash equilibria of normal form games. Since NASH is a well-known PPAD-complete problem, this framework has potential applications to other $PPAD$…

Computer Science and Game Theory · Computer Science 2021-10-27 Aadesh Salecha

We prove that for analytic functions in low dimension, the convergence rate of the deep neural network approximation is exponential.

Machine Learning · Computer Science 2018-07-03 Weinan E , Qingcan Wang

Let $X$ be a real analytic orbifold. Then each stratum of $X$ is a subanalytic subset of $X$. We show that $X$ has a unique subanalytic triangulation compatible with the strata of $X$. We also show that every ${\rm C}^r$-orbifold, $1\leq…

Geometric Topology · Mathematics 2011-06-07 Marja Kankaanrinta

Measurable sets are defined as those locally approximable, in a certain sense, by sets in the given algebra (or ring). A corresponding measure extension theorem is proved. It is also shown that a set is locally approximable in the mentioned…

Classical Analysis and ODEs · Mathematics 2017-02-14 Iosif Pinelis

We study universal approximation of continuous functionals on compact subsets of products of Hilbert spaces. We prove that any such functional can be uniformly approximated by models that first take finitely many continuous linear…

Machine Learning · Computer Science 2026-02-04 Andrey Krylov , Maksim Penkin