Related papers: Artin approximation compatible with a change of va…
The classical Artin approximation (AP) reads: any formal solution of a system of (analytic, resp. algebraic) equations of implicit function type is approximated by ``ordinary" solutions (i.e. analytic, resp. algebraic). Morphisms of…
In 1968, M. Artin proved that any formal power series solution of a system of analytic equations may be approximated by convergent power series solutions. Motivated by this result and a similar result of P{\l}oski, he conjectured that this…
Let F be a holomorphic map whose components satisfy some polynomial relations. We present an algorithm for constructing Nash maps locally approximating F, whose components satisfy the same relations.
We study various approximation results of solutions of equations $f(x,Y)=0$ where $f(x,Y)\in\mathbb K[[x]][Y]^r$ and $x$ and $Y$ are two sets of variables, and where some components of the solutions $y(x)\in\mathbb K[[x]]^m$ do not depend…
We provide the detailed proof of a strengthened version of the M. Artin Approximation Theorem.
We give a new and elementary proof of the nested Artin approximation Theorem for linear equations with algebraic power series coefficients. Moreover, for any Noetherian local subring of the ring of formal power series, we clarify the…
This work proposes a novel set of techniques for approximating a Nash equilibrium in a finite, normal-form game. It achieves this by constructing a new reformulation as solving a parameterized system of multivariate polynomials with tunable…
In this article, we consider generalized Nash games where the associated constraint map is not necessarily self. The classical Nash equilibrium may not exist for such games and therefore we introduce the notion of best approximate solution…
AI in Math deals with mathematics in a constructive manner so that reasoning becomes automated, less laborious, and less error-prone. For algorithms, the question becomes how to automate analyses for specific problems. For the first time,…
This paper shows how to build a formal analytical solution for a differential equation of arbitrary order and with variable coefficients. It proofs that the most known approximated solutions for such a problem can be derived from the…
We propose the first loss function for approximate Nash equilibria of normal-form games that is amenable to unbiased Monte Carlo estimation. This construction allows us to deploy standard non-convex stochastic optimization techniques for…
The classical Artin--Whaples approximation theorem allows to simultaneously approximate finitely many different elements of a field with respect to finitely many pairwise inequivalent absolute values. Several variants and generalizations…
In this paper, we investigate the learnability of the function approximator that approximates Nash equilibrium (NE) for games generated from a distribution. First, we offer a generalization bound using the Probably Approximately Correct…
In probability theory, how to approximate the solution of a stochastic differential equation is an important topic. In Watanabe's classical textbook, by an approximation of the Wiener process, solutions of approximated equations converge to…
Variational inequality problems allow for capturing an expansive class of problems, including convex optimization problems, convex Nash games and economic equilibrium problems, amongst others. Yet in most practical settings, such problems…
This paper deals with the application of Approximation Theory type techniques to study a classical problem in Probability: estimating the parameter of a biased coin. For this purpose, a Minimax Estimation problem is considered and the…
We present a method for constructing global analytical expressions that approximate a function over its entire range. These approximations not only mirror the original function as accurately as desired, but are purposefully created to…
We investigate the variable-exponent Abel integral equations and corresponding fractional Cauchy problems. The main contributions of the work are enumerated as follows: (i) We develop an approximate inversion technique for variable-exponent…
A method for approximate solution of initial value and spectral problems for one dimensional Dirac equation based on an analytic approximation of the transmutation operator is presented. In fact the problem of numerical approximation of…
The approximate discrete Radon transform (ADRT) is a hierarchical multiscale approximation of the Radon transform. In this paper, we factor the ADRT into a product of linear transforms that resemble convolutions and derive an explicit…