Related papers: Computability of a Whitney Extension

Let $C$ be a subset of $\mathbb{R}^n$ (not necessarily convex), $f:C\to\mathbb{R}$ be a function, and $G:C\to\mathbb{R}^n$ be a uniformly continuous function, with modulus of continuity $\omega$. We provide a necessary and sufficient…

We study a variant of the Whitney extension problem for the space $C^{k,\omega}(R^n)$. We identify this space with a space of Lipschitz mappings from $R^n$ into the space $P_k \times R^n$ of polynomial fields on $R^n$ equipped with a…

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

Whitney's extension problem, i.e., how one can tell whether a function $f : X \to \mathbb R$, $X \subseteq \mathbb R^n$, is the restriction of a $C^m$-function on $\mathbb R^n$, was solved in full generality by Charles Fefferman in 2006. In…

The purpose of this paper is to address a manifold-based version of Whitney's extension problem: Given a compact set $E\subset\mathbb{R}^n$, how can we tell if there exists a $d$-dimensional, $C^m$-smooth manifold $\mathcal{M}\supset E$? We…

In this announcement we consider the following problem. Let $n,m\geq 1$, $U\subset\mathbb R^n$ open. In this paper we provide a sharp solution to the following Whitney distortion extension problems: (a) Let $\phi:U\to \mathbb R^n$ be a…

Given $X$ a Hilbert space, $\omega$ a modulus of continuity, $E$ an arbitrary subset of $X$, and functions $f:E\to\mathbb{R}$, $G:E\to X$, we provide necessary and sufficient conditions for the jet $(f,G)$ to admit an extension $(F, \nabla…

We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…

Let $\phi$ be a conformal map of the unit disk onto a domain $D$, and suppose $\phi$ has a boundary extension. We show that arbitrarily good approximations of the boundary extension of $\phi$ can be computed from sufficiently good…

We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically…

We prove a version of Whitney's extension theorem in the ultradifferentiable Beurling setting with controlled loss of regularity. As a by-product we show the existence of continuous linear extension operators on certain spaces of Whitney…

For a closed real algebraic plane affine curve dividing its complexification and equipped with a complex orientation, the Whitney number is expressed in terms of behavior of its complexification at infinity.

We consider a global, nonlinear version of the Whitney extension problem for manifold-valued smooth functions on closed domains $C$, with non-smooth boundary, in possibly non-compact manifolds. Assuming $C$ is a submanifold with corners, or…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

In the present paper it is shown that real function $g(x)=\int_{0}^{x}f(t)dt$ is a linear-space computable real function on interval $[0,1]$ if $f$ is a linear-space computable $C^2[0,1]$ real function on interval $[0,1]$, and this result…

Let $X$ denote a Hilbert space. Given a compact subset $K$ of $X$ and two continuous functions $f:K\to\mathbb{R}$, $G:K\to X$, we show that a necessary and sufficient condition for the existence of a convex function $F\in C^1(X)$ such that…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

The Whitney extension theorem is a classical result in analysis giving a necessary and sufficient condition for a function defined on a closed set to be extendable to the whole space with a given class of regularity. It has been adapted to…

Cost functions provide a framework for constructions of sets Turing below the halting problem that are close to computable. We carry out a systematic study of cost functions. We relate their algebraic properties to their expressive…

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…