English
Related papers

Related papers: Computability of a Whitney Extension

200 papers

Suppose H is a space of functions on X. If H is a Hilbert space with reproducing kernel then that structure of H can be used to build distance functions on X. We describe some of those and their interpretations and interrelations. We also…

Complex Variables · Mathematics 2012-05-01 Nicola Arcozzi , Richard Rochberg , Eric T. Sawyer , Brett D. Wick

A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names. Two ways to eliminate the using of such names in certain cases are…

Logic in Computer Science · Computer Science 2015-07-01 Dimiter Skordev

Let (X,m) and (Y,n) be standard measure spaces. A function f in $L^\infty(X\times Y,m\times n)$ is called a (measurable) Schur multiplier if the map $S_f$, defined on the space of Hilbert-Schmidt operators from $L_2(X,m)$ to $L_2(Y,n)$ by…

Functional Analysis · Mathematics 2010-01-27 V. S. Shulman , I. G. Todorov , L. Turowska

Building on the univariate techniques developed by Ray and Schmidt-Hieber, we study the class $\mathcal{F}^s(\mathbb{R}^n)$ of multivariate nonnegative smooth functions that are sufficiently flat near their zeroes, which guarantees that…

Functional Analysis · Mathematics 2024-01-11 Fushuai Jiang

The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…

Complex Variables · Mathematics 2015-05-06 Jorge L. deLyra

Fractional partial differential equations (FDEs) are used to describe phenomena that involve a "non-local" or "long-range" interaction of some kind. Accurate and practical numerical approximation of their solutions is challenging due to the…

Numerical Analysis · Mathematics 2019-07-18 Justin Crum , Joshua A. Levine , Andrew Gillette

A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…

Computational Geometry · Computer Science 2007-05-23 Helmut Alt , Maike Buchin

We prove an extension theorem (with non-tangential limits) for vector-valued Baire one functions. Moreover, at every point where the function is continuous (or bounded), the continuity (or boundedness) is preserved. More precisely: Let $H$…

Functional Analysis · Mathematics 2016-05-25 Jan Kolář , Martin Koc

The aim of this expository article is to present recent developments in the centuries old discussion on the interrelations between continuous and differentiable real valued functions of one real variable. The truly new results include,…

Functional Analysis · Mathematics 2018-06-29 Krzysztof C. Ciesielski , Juan B. Seoane Sepúlveda

We study approximately differentiable functions on metric measure spaces admitting a Cheeger differentiable structure. The main result is a Whitney-type characterization of approximately differentiable functions in this setting. As an…

Classical Analysis and ODEs · Mathematics 2012-07-26 Estibalitz Durand-Cartagena , Lizaveta Ihnatsyeva , Riikka Korte , Marta Szumańska

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

Let $X$ and $Y$ be Banach or normed linear spaces and $F\subset X$ a closed set. We apply our recent extension theorem for vector-valued Baire one functions arXiv:1512.03717 to obtain an extension theorem for vector-valued functions…

Classical Analysis and ODEs · Mathematics 2017-01-24 Martin Koc , Jan Kolář

In this article, we give a full description of the Wadge degrees of Borel functions from $\omega^\omega$ to a better quasi ordering $\mathcal{Q}$. More precisely, for any countable ordinal $\xi$, we show that the Wadge degrees of…

Logic · Mathematics 2017-05-23 Takayuki Kihara , Antonio Montalbán

For $\delta$ an $m$-tuple of analytic functions, we define an algebra $\hidg$, contained in the bounded analytic functions on the analytic polyhedron $ {|\delta^l(z)| < 1, \ 1 \leq l \leq m}$, and prove a representation formula for it. We…

Complex Variables · Mathematics 2012-12-24 Jim Agler , John E. McCarthy

We introduce the computable FS-jump, an analog of the classical Friedman--Stanley jump in the context of equivalence relations on the natural numbers. We prove that the computable FS-jump is proper with respect to computable reducibility.…

Logic · Mathematics 2023-05-29 John D. Clemens , Samuel Coskey , Gianni Krakoff

The theory of fractional calculus in the complex plane was not built with a specific application in mind. The main obstacle to application was the difficulty with obtaining analytic continuations of fractional derivatives and integrals. It…

Classical Analysis and ODEs · Mathematics 2015-10-01 V. P. Gurarii

Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…

Logic in Computer Science · Computer Science 2026-03-03 Clément Aubert , Jean Krivine

In this paper we study the set of functions $\GG$-valued which can be approximated by $\GG$-valued continuous functions in the norm $L^\infty_{\GG}(I,w)$, where $I$ is a compact interval, $\GG$ is a real and separable Hilbert space and $w$…

Classical Analysis and ODEs · Mathematics 2008-05-07 Yamilet Quintana

The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…

Computational Complexity · Computer Science 2023-06-22 Carsten Rösnick-Neugebauer

Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…

Computational Complexity · Computer Science 2024-04-12 Yahel Manor , Or Meir
‹ Prev 1 4 5 6 7 8 10 Next ›