Related papers: On computability and disintegration

We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly…

By the Riesz representation theorem using the Riemann-Stieltjes integral, linear continuous functionals on the set of continuous functions from the unit interval into the reals can either be characterized by functions of bounded variation…

Investigating the direct integral decomposition of von Neumann algebras of bounded module operators on self-dual Hilbert W*-moduli an equivalence principle is obtained which connects the theory of direct disintegration of von Neumann…

Let M be a complete metric space. It is proved that if the space or scalar-valued bounded continuous functions on M admits an isometric shift, then M is separable.

We show that the existence of disintegration for cylindrical measures follows from a general disintegration theorem for countably additive measures.

A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…

Consider the differential operator H = -(1/m(x))L, where L is the N-dimensional Laplacian, in the weighted Hilbert space of square integrable functions on N-dimensional Euclidean space with weight m(x)dx. Here m(x) is a positive step…

We prove the spaceability of the set of hypercyclic vectors for {\em shifts-like operators}. Shift-like operators appear naturally as composition operators on $L^p(X)$, when the underlying space $X$ is dissipative. In the process of proving…

Let $X$ be a pointed compact metric space. Assuming that $\mathrm{lip}_0(X)$ has the uniform separation property, we prove that every weakly compact composition operator on spaces of Lipschitz functions $\mathrm{Lip}_0(X)$ and…

The Weihrauch degrees are a tool to gauge the computational difficulty of mathematical problems. Often, what makes these problems hard is their discontinuity. We look at discontinuity in its purest form, that is, at otherwise constant…

The theory of symmetric, non-selfadjoint operators has several deep applications to the complex function theory of certain reproducing kernel Hilbert spaces of analytic functions, as well as to the study of ordinary differential operators…

In this paper we prove disintegration results for self-conformal measures and affinely irreducible self-similar measures. The measures appearing in the disintegration resemble self-conformal/self-similar measures for iterated function…

We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider computably enumerable bases. This indicates the existence of a…

In this paper we prove an invertibility criterion for certain operators which is given as a linear algebraic combination of Toeplitz operators and Fourier multipliers acting on the Hardy space of the unit disc. Very similar to the case of…

There have been, over the last 8 years, a number of far reaching extensions of the famous original F. and M. Riesz's uniqueness theorem that states that if a bounded analytic function in the unit disc of the complex plane $\Bbb C$ has the…

$T$-semi-selfdecomposability and subclasses $L_m(b, Q)$ and $\tilde L_m(b, Q)$ of measures on complete separable metric vector spaces are introduced and basic properties are proved. In particular, we show that $\mu$ is…

Let $X$ and $Y$ be separable Banach spaces. Suppose $Y$ either has a shrinking basis or $Y$ is isomorphic to $C(2^\mathbb{N})$ and $A$ is a subset of weakly compact operators from $X$ to $Y$ which is analytic in the strong operator…

A (fragment of a) process algebra satisfies unique parallel decomposition if the definable behaviours admit a unique decomposition into indecomposable parallel components. In this paper we prove that finite processes of the pi-calculus,…

We introduce the notion of being Weihrauch-complete for layerwise computability and provide several natural examples related to complex oscillations, the law of the iterated logarithm and Birkhoff's theorem. We also consider hitting time…

This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation,…