Related papers: Computability of a Whitney Extension

We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…

We prove necessary and sufficient conditions for the validity of Whitney's extension theorem in the ultradifferentiable Roumieu setting with controlled loss of regularity.

In the paper [E. Jim\'enez-Fern\'andez, J. Rodr\'{\i}guez-L\'opez, E. A. S\'anchez-P\'erez, Fuzzy Sets and Systems 406 (2021),66-81], a McShane-Whitney extension theorem is presented for real-valued fuzzy Lipschitz maps between fuzzy metric…

The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…

Let $\phi\colon A\rightarrow B$ be an algebra extension. We prove that if $\phi$ is split, the derived-discreteness of $A$ implies the derived-discreteness of $B$; if $\phi$ is separable and the right $A$-module $B$ is projective, the…

We study a variant of the Whitney extension problem for the space $C^k\Lambda^m_{\omega}(R^n)$ of functions whose partial derivatives of order $k$ satisfy the generalized Zygmund condition. We identify $C^k\Lambda^m_{\omega}(R^n)$ with a…

We find sufficient conditions on a set $\mathscr{M}\subset\mathbf{R}^n\times\mathscr{L}(\mathbf{R}^n,\mathbf{R}^m)$ ensuring that the set of functions such that $(F(x),DF(x))\in\mathscr{M}$ is rectifiable. We also prove a more general…

We introduce a modified version of the Whitney extension operators for collections of functions from a closed subset of $\mathbb{R}^n$ into scales of Banach spaces with smoothing operators. We prove an extension theorem for collections…

Given a faithful finite-dimensional representation $V$ of a finite group $G$ over any field $\mathbb{F}$, we show that any irreducible ${\mathbb{F}}G$-module $W$ appears, as a submodule or a quotient, in $\mathrm{Sym}^m(V)$ for some integer…

Let $\Omega\subset\mathbb{R}^n$ be an open, connected subset of $\mathbb{R}^n$, and let $F\colon\Omega-\Omega\to\mathbb{C}$, where $\Omega-\Omega=\{x-y\colon x,y\in\Omega\}$, be a continuous positive definite function. We give necessary and…

By studying the spectral aspects of the fractional part function in a well-known separable Hilbert space, we show, among other things, a rational approximation of the Riemann zeta function and its derivatives valid on every vertical line in…

Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…

This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared…

The Whittaker function and its diverse extensions have been actively investigated. Here we introduce an extension of the Whittaker function by using the known extended confluent hypergeometric function $\Phi_{p,v}$ and investigate some of…

Let $E$ be an arbitrary subset of $\mathbb{R}^n$, and $f:E\to\mathbb{R}$, $G:E\to\mathbb{R}^n$ be given functions. We provide necessary and sufficient conditions for the existence of a convex function $F\in…

We use the Cauchy-Crofton formula to show that every definable cell (bounded by a ball with rational radius) in an O-minimal expansion of a field extension of the real numbers satisfies the Whitney arc property.

We prove a computable version of the Hall Harem Theorem where the matching realizes a unary function with controlled sizes of cycles. We apply it to non-amenable computable coarse spaces. As a result, we obtain a computable version of the…

In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…

In this paper, we show that while almost all functions require exponential size branching programs to compute, for all functions $f$ there is a branching program computing a doubly exponential number of copies of $f$ which has linear size…

We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable…