Related papers: Computability of a Whitney Extension

We show that \emph{efficient Turing computability} at any fixed input/output precision implies the existence of \emph{compositionally sparse} (bounded-fan-in, polynomial-size) DAG representations and of corresponding neural approximants…

We show that for all $k\ge 1$, there exists an integer $N(k)$ such that for all $n\ge N(k)$ the $k$-th order jet scheme over the commuting $n\times n$ matrix pairs scheme is reducible. At the other end of the spectrum, it is known that for…

Motivated by recent interests in predictive inference under distribution shift, we study the problem of approximating finite weighted exchangeable sequences by a mixture of finite sequences with independent terms. Various bounds are derived…

Computations in high-dimensional spaces can often be realized only approximately, using a certain number of projections onto lower dimensional subspaces or sampling from distributions. In this paper, we are interested in pairs of…

In this article, we deal with the efficient computation of the Wright function in the cases of interest for the expression of solutions of some fractional differential equations. The proposed algorithm is based on the inversion of the…

Let $w$ be a word in alphabet $\{x,D\}$ with $m$ $x$'s and $n$ $D$'s. Interpreting "$x$" as multiplication by $x$, and "$D$" as differentiation with respect to $x$, the identity $wf(x) = x^{m-n}\sum_k S_w(k) x^k D^k f(x)$, valid for any…

We study Whitney-type estimates for approximation of convex functions in the uniform norm on various convex multivariate domains while paying a particular attention to the dependence of the involved constants on the dimension and the…

For each $p>1$ and each positive integer $m$ we give intrinsic characterizations of the restriction of the Sobolev space $W^m_p(R)$ and homogeneous Sobolev space $L^m_p(R)$ to an arbitrary closed subset $E$ of the real line. In particular,…

We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function $g$ and an additive function $f$, we examine the size of the quantity $E(f,g;x)=\# \{n\leq x:f(n)=g(n)\}$. We establish a lower…

According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…

This paper is devoted to certain applications of classical Whitney decomposition of the upper half space R^n+1 to various problems in harmonic function spaces in the upper half space.We obtain sharp new assertions on embeddings,distances…

We propose a new type of quantum computer which is used to prove a spectral representation for a class F of computable sets. When S in F codes the theorems of a formal system, the quantum computer produces through measurement all theorems…

We show that the variational representations for f-divergences currently used in the literature can be tightened. This has implications to a number of methods recently proposed based on this representation. As an example application we use…

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

In this paper we introduce the notion of $e$-computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.

We investigate properties of holomorphic extensions in the one-variable case of Whitney's Approximation Theorem on intervals. Improving a result of Gauthier-Kienzle, we construct tangentially approximating functions which extend…

Let $k$ be a field, $V$ be a $k$-vector space and $X\subset V$ an algebraic irreducible subvariety. We say that a function $f:X(k) \to k$ is weakly linear if its restriction to any two-dimensional linear subspace $W$ of $V$ contained in $X$…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable…

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…