Related papers: Bornes effectives des fonctions d'approximation de…

An algorithm for the systematic analytical approximation of multi-scale Feynman integrals is presented. The algorithm produces algebraic expressions as functions of the kinematical parameters and mass scales appearing in the Feynman…

We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…

The article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with…

We generalize the Bernstein-Walsh-Siciak theorem on polynomial approximation in $\mathbb{C}^n$ to the case where the polynomial ring $\mathcal{P}(\mathbb{C}^n)$ is replaced by a subring $\mathcal{P}^S(\mathbb{C}^n)$ consisting of all…

Approximation theorems for algebraic stacks over a number field $k$ are studied in this article. For G a connected linear algebraic group over a number field we prove strong approximation with Brauer-Manin obstruction for the classifying…

We combine the method of exchangeable pairs with Stein's method for functional approximation. As a result, we give a general linearity condition under which an abstract Gaussian approximation theorem for stochastic processes holds. We apply…

We present here a new approach for computing Gr\"obner bases for bilateral modules over an effective ring. Our method is based on Weispfenning notion of restricted Gr\"obner bases and related multiplication.

In this article, we establish the arithmetic purity of strong approximation for smooth loci of weighted projective spaces. By using this result and the descent method, we also prove that the arithmetic purity of strong approximation with…

This article establishes a real-variable argument for Zygmund's theorem on almost everywhere convergence of strong arithmetic means of partial sums of Fourier series on $\mathbb{T}$, up to passing to a subsequence. Our approach extends to,…

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

In this article, we prove approximation theorems in classes of deep and shallow neural networks with analytic activation functions by elementary arguments. We prove for both real and complex networks with non-polynomial activation that the…

For diophantine equations of the form ax^2+bxy+cy^2+g=0 over Z whose coefficients satisfy some assumptions, we show that a condition with respect to Artin reciprocity map, which we call the Artin condition, is the only obstruction to the…

A large system of ordinary differential equations is approximated by a parabolic partial differential equation with dynamic boundary condition and a different one with Robin boundary condition. Using the theory of differential operators…

We study the Artin Approximation property with constraints in a different frame. As a consequence we give a nested Artin Strong Approximation property for algebraic power series rings over a field.

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

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

The affine Hilbert function is a classical algebraic object that has been central, among other tools, to the development of the polynomial method in combinatorics. Owing to its concrete connections with Gr\"obner basis theory, as well as…

We consider the cumulant expansion of the PAM employing the hybridization as perturbation (Phys. Rev. B 50, 17933 (1994)), and we obtain formally exact one-electron Green's functions (GF). These GF contain effective cumulants that are as…

A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…

The paper establishes a functional version of the Hoeffding combinatorial central limit theorem. First, a pre-limiting Gaussian process approximation is defined, and is shown to be at a distance of the order of the Lyapounov ratio from the…