Related papers: Weihrauch Degrees, Omniscience Principles and Weak…
We introduce the post-processing preorder and equivalence relations for general measurements on a possibly infinite-dimensional general probabilistic theory described by an order unit Banach space $E$ with a Banach predual. We define the…
In this note we show that for analytic semigroups the so-called Weiss condition of uniform boundedness of the operators $Re(\lambda)^\einhalb C(\lambda+A)^{-1}, \qquad Re(\lambda)>0$ on the complex right half plane and weak Lebesgue…
We extend the duality principle for the $\Gamma$-convergence of convex lower semicontinuous functions, which was previously established only in separable reflexive Banach spaces, to the broader class of weakly compactly generated (WCG)…
In this paper we study the Weihrauch complexity of projection operators onto closed subsets of the Euclidean space. We show that some fundamental degrees of the Weihrauch lattice can be characterized in terms of such operators.
We prove that, any problem of minimization of proper lower semicontinuous function defined on a normal Hausdorff space, is canonically equivalent to a problem of minimization of a proper weak * lower semicontinuous convex function defined…
An artinian graded algebra, $A$, is said to have the Weak Lefschetz property (WLP) if multiplication by a general linear form has maximal rank in every degree. A vast quantity of work has been done studying and applying this property,…
We introduce a cohomology theory of grading-restricted vertex algebras. To construct the {\it correct} cohomologies, we consider linear maps from tensor powers of a grading-restricted vertex algebra to "rational functions valued in the…
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…
We present a systematic algebraic approach for the weak coupling of Cauchy problems to multiple Lohe tensor models. For this, we identify an admissible Cauchy problem to the Lohe tensor (LT) model with a characteristic symbol consisting of…
In this paper we study the problem of extending functions with values in a locally convex Hausdorff space $E$ over a field $\mathbb{K}$, which have weak extensions in a weighted Banach space $\mathcal{F}\nu(\Omega,\mathbb{K})$ of…
We study the computational content of the Brouwer Fixed Point Theorem in the Weihrauch lattice. Connected choice is the operation that finds a point in a non-empty connected closed set given by negative information. One of our main results…
We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…
This habilitation thesis centres on linearisation of vector-valued functions which means that vector-valued functions are represented by continuous linear operators. The first question we face is which vector-valued functions may be…
In this paper we prove analogues of Korovkin's theorem in the context of weakly nonlinear and monotone operators acting on Banach lattices of functions of several variables. Our results concern the convergence almost everywhere, the…
We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers. The theorems we are chiefly interested in assert the…
We study the approximation and statistical complexity of learning collections of operators in a shared multi-task setting, with a focus on the Multiple Neural Operators (MNO) architecture. For broad classes of Lipschitz multiple operator…
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…
In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there…
Density of Lipschitz functions in Newtonian spaces based on quasi-Banach function lattices is discussed. Newtonian spaces are first-order Sobolev-type spaces on abstract metric measure spaces defined via (weak) upper gradients. Our main…
In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…