Related papers: Weak-star convergence and a polynomial approximati…

Many practical problems need the output of a machine learning model to satisfy a set of constraints, $K$. Nevertheless, there is no known guarantee that classical neural network architectures can exactly encode constraints while…

Let $X$ be an inner product space, let $G$ be a group of orthogonal transformations of $X$, and let $R$ be a bounded $G$-stable subset of $X$. We define very weak and very strong regularity for such pairs $(R,G)$ (in the sense of…

Let $S$ be a dense subring of the real numbers. In this paper we prove a polynomial version of Van der Waerden's theorem near zero. In fact, we prove that if $p_1,\ldots,p_m \in \mathbb{Z}[x]$ are polynomials such that $p_i(0) = 0$ and…

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…

This paper presents a proof that existence of a polynomial Lyapunov function is necessary and sufficient for exponential stability of sufficiently smooth nonlinear ordinary differential equations on bounded sets. The main result states that…

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…

Suppose that $S_1$ and $S_2$ are nonempty subsets of a complete metric space $(\mathcal{M},d)$ and $\phi,\psi:S_1\to S_2$ are mappings. The aim of this work is to investigate some conditions on $\phi$ and $\psi$ such that the two functions,…

We show that for multivariate Freud-type weights $W_\alpha(x)=\exp(-|x|^\alpha)$, $\alpha>1$, any convex function $f$ on $R^d$ satisfying $fW_\alpha\in L_p(R^d)$ if $1\le p<\infty$, or $\lim_{|x|\to\infty}f(x)W_\alpha(x)=0$ if $p=\infty$,…

In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…

The main result (roughly) is that if (H_i) converges weakly to H and if also f(H_i) converges weakly to f(H), for a single strictly convex continuous function f, then (H_i) must converge strongly to H. One application is that if f(pr(H)) =…

Let $K/k$ be an extension of number fields, and let $P(t)$ be a quadratic polynomial over $k$. Let $X$ be the affine variety defined by $P(t) = N_{K/k}(\mathbf{z})$. We study the Hasse principle and weak approximation for $X$ in three…

Let f be a definable function, enough differentiable. Under the condition of having strongly isolated singularities at infinity at a regular value c we give a sufficient condition expressed in terms of the total absolute curvature function…

Let $C$ be a compact convex subset of $\mathbb{R}^n$, $f:C\to\mathbb{R}$ be a convex function, and $m\in\{1, 2, ..., \infty\}$. Assume that, along with $f$, we are given a family of polynomials satisfying Whitney's extension condition for…

We study $\mathbb{R}_{\textrm{an},\exp}$-definable functions $f:\mathbb{R}\to \mathbb{R}$ that take integer values at all sufficiently large positive integers. If $|f(x)|= O\big(2^{(1+10^{-5})x}\big)$, then we find polynomials $P_1, P_2$…

We prove a variant of the Lavrentiev's approximation theorem that allows us to approximate a continuous function on a compact set K in C without interior points and with connected complement, with polynomial functions that are nonvanishing…

We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…

The degrees of polynomials representing or approximating Boolean functions are a prominent tool in various branches of complexity theory. Sherstov recently characterized the minimal degree deg_{\eps}(f) among all polynomials (over the…

Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…

We study the Lusin approximation problem for real-valued measurable functions on Carnot groups. We prove that k-approximate differentiability almost everywhere is equivalent to admitting a Lusin approximation by $C^{k}_{\mathbb{G}}$ maps.…

Bernstein polynomials provide a constructive proof for the Weierstrass approximation theorem, which states that every continuous function on a closed bounded interval can be uniformly approximated by polynomials with arbitrary accuracy.…