Related papers: Weihrauch Degrees, Omniscience Principles and Weak…

We prove an extrapolation of compactness theorem for operators on Banach function spaces satisfying certain convexity and concavity conditions. In particular, we show that the boundedness of an operator $T$ in the weighted Lebesgue scale…

The manifold hypothesis posits that high-dimensional data typically resides on low-dimensional sub spaces. In this paper, we assume manifold hypothesis to investigate graph-based semi-supervised learning methods. In particular, we examine…

We develop a Lagrange multiplier theory for nonconvex set-valued optimization problems under Lipschitz-type regularity conditions. Instead of classical continuous linear functionals, we introduce closed convex processes -- set-valued…

We extend the univariate Newton interpolation algorithm to arbitrary spatial dimensions and for any choice of downward-closed polynomial space, while preserving its quadratic runtime and linear storage cost. The generalisation supports any…

The Massive Parallel Computation (MPC) model is a theoretical framework for popular parallel and distributed platforms such as MapReduce, Hadoop, or Spark. We consider the task of computing a large matching or small vertex cover in this…

We consider weighted composition operators on spaces of analytic functions on the unit disc, which take values in some complex Banach space. We provide necessary and sufficient conditions for the boundedness and (weak) compactness of…

Seminal work by Edmonds and Lovasz shows the strong connection between submodularity and convexity. Submodular functions have tight modular lower bounds, and subdifferentials in a manner akin to convex functions. They also admit poly-time…

We develop synthetic notions of oracle computability and Turing reducibility in the Calculus of Inductive Constructions (CIC), the constructive type theory underlying the Coq proof assistant. As usual in synthetic approaches, we employ a…

We introduce two notions of effective reducibility for set-theoretical statements, based on computability with Ordinal Turing Machines (OTMs), one of which resembles Turing reducibility while the other is modelled after Weihrauch…

Denote by $[0,\omega_1)$ the locally compact Hausdorff space consisting of all countable ordinals, equipped with the order topology, and let $C_0[0,\omega_1)$ be the Banach space of scalar-valued, continuous functions which are defined on…

Second order stationary models in time series analysis are based on the analysis of essential statistics whose computations follow a common pattern. In particular, with a map-reduce nomenclature, most of these operations can be modeled as…

Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…

Approximation of high-dimensional functions is a problem in many scientific fields that is only feasible if advantageous structural properties, such as sparsity in a given basis, can be exploited. A relevant tool for analysing sparse…

In this paper, we will study some properties of b-weakly compact operators and we will investigate their relationships to some variety of operators on the normed vector lattices. With some new conditions, we show that the modulus of an…

We prove the Verlinde conjecture in the following general form: Let V be a simple vertex operator algebra satisfying the following conditions: (i) The homogeneous subspaces of V of weights less than 0 are 0, the homogeneous subspace of V of…

If a separable Banach space $X$ is such that for some nonquasireflexive Banach space $Y$ there exists a surjective strictly singular operator $T:X\to Y$ then for every countable ordinal $\alpha $ the dual of $X$ contains a subspace whose…

Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…

Many aspects of pluripotential theory are generalized to quaternionic $m$-subharmonic functions. We introduce quaternionic version of notions of the $m$-Hessian operator, $m$-subharmonic functions, $m$-Hessian measure, $m$-capapcity, the…

The objective of this work is to study weak infeasibility in second order cone programming. For this purpose, we consider a relaxation sequence of feasibility problems that mostly preserve the feasibility status of the original problem.…

We consider the parallel complexity of submodular function minimization (SFM). We provide a pair of methods which obtain two new query versus depth trade-offs a submodular function defined on subsets of $n$ elements that has integer values…