English
Related papers

Related papers: Approximation on Nash sets with monomial singulari…

200 papers

Let $\mathcal F$ be either the set of all bounded holomorphic functions or the set of all $m$-homogeneous polynomials on the unit ball of $\ell\_r$. We give a systematic study of the sets of all $u\in\ell\_r$ for which the monomial…

Functional Analysis · Mathematics 2016-02-01 Frédéric Bayart , Andreas Defant , Sunke Schlüters

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

Numerical Analysis · Mathematics 2012-01-18 Massimo Fornasier , Karin Schnass , Jan Vybiral

This paper seeks to prove the bijectivity of the "Nash mapping" from the set of irreducible components of the scheme parametrizing analytic arcs on an algebraic surface $X$ whose origin is a singular point, into the set of irreducible…

Algebraic Geometry · Mathematics 2018-12-04 Augusto Nobile

We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…

General Mathematics · Mathematics 2020-10-21 Yu-Lin Chou

This paper introduces a novel algorithmic solution for the approximation of a given multivariate function by a nomographic function that is composed of a one-dimensional continuous and monotone outer function and a sum of univariate…

Information Theory · Computer Science 2015-07-14 Steffen Limmer , Jafar Mohammadi , Slawomir Stanczak

We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…

Functional Analysis · Mathematics 2023-11-29 Yuri Malykhin , Konstantin Ryutin

Many numerical algorithms in scientific computing -- particularly in areas like numerical linear algebra, PDE simulation, and inverse problems -- produce outputs that can be represented by semialgebraic functions; that is, the graph of the…

Machine Learning · Computer Science 2025-03-04 S. David Mis , Matti Lassas , Maarten V. de Hoop

Structural properties are given for $D(K)$, the Banach algebra of (complex) differences of bounded semi-continuous functons on a metric space $K$. For example, it is proved that if all finite derived sets of $K$ are non-empty, then a…

Functional Analysis · Mathematics 2016-09-06 Haskell P. Rosenthal

We study two types of approximations of Lipschitz maps with derivatives of maximal slopes on Banach spaces. First, we characterize the Radon-Nikod\'ym property in terms of strongly norm attaining Lipschitz maps and maximal derivative…

Functional Analysis · Mathematics 2024-10-23 Geunsu Choi

We study the Banach algebras of bounded holomorphic functions on the unit disk whose boundary values, having, in a sense, the weakest possible discontinuities, belong to the algebra of semi-almost periodic functions on the unit circle. The…

Complex Variables · Mathematics 2009-11-06 A. Brudnyi , D. Kinzebulatov

The universal approximation theorem is generalised to uniform convergence on the (noncompact) input space $\mathbb{R}^n$. All continuous functions that vanish at infinity can be uniformly approximated by neural networks with one hidden…

Machine Learning · Computer Science 2024-03-05 Teun D. H. van Nuland

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

Logic · Mathematics 2014-10-16 Robin Hirsch , Marcel Jackson , Szabolcs Mikulás

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…

Computer Science and Game Theory · Computer Science 2024-11-05 Ian Gemp

Let $R$ be a real closed field and $K:=R(i)$ its algebraic closure. Let $U\subset K^n$ be an open and definable set in a fixed o-minimal structure. In this note, we study the relationship between definability of a $K$-holomorphic function…

Algebraic Geometry · Mathematics 2026-05-05 Antonio Carbone , Enrico Savi

We characterize the approximate monomial complexity, sign monomial complexity , and the approximate L 1 norm of symmetric functions in terms of simple combinatorial measures of the functions. Our characterization of the approximate L 1 norm…

Computational Complexity · Computer Science 2017-04-12 Anil Ada , Omar Fawzi , Raghav Kulkarni

Disjointly constrained multilinear programming concerns the problem of maximizing a multilinear function on the product of finitely many disjoint polyhedra. While maximizing a linear function on a polytope (linear programming) is known to…

Optimization and Control · Mathematics 2016-03-14 Kai Kellner

We show the existence of a deep neural network capable of approximating a wide class of high-dimensional approximations. The construction of the proposed neural network is based on a quasi-optimal polynomial approximation. We show that this…

Numerical Analysis · Mathematics 2019-12-09 Joseph Daws , Clayton Webster

Properties of first-order Sobolev-type spaces on abstract metric measure spaces, so-called Newtonian spaces, based on quasi-Banach function lattices are investigated. The set of all weak upper gradients of a Newtonian function is of…

Functional Analysis · Mathematics 2013-08-14 Lukáš Malý

We describe all metric spaces that have sufficently many affine functions. As an application we obtain a metric characterization of linear-convex subsets of Banach spaces.

Metric Geometry · Mathematics 2013-04-25 Petra Schwer , Alexander Lytchak

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

Numerical Analysis · Mathematics 2025-06-27 Kingsley Yeon , Steven B. Damelin