Related papers: The Vitali Covering Theorem in the Weihrauch Latti…
In this paper we study Weihrauch reducibility for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice…
We classify the computational content of the Bolzano-Weierstrass Theorem and variants thereof in the Weihrauch lattice. For this purpose we first introduce the concept of a derivative or jump in this lattice and we show that it has some…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
In this paper, we study the existence of minimal covers and strong minimal covers in the Weihrauch degrees. We characterize when a problem $f$ is a minimal cover or strong minimal cover of a problem $h$. We show that strong minimal covers…
This paper deals with inverse problems subject to imprecise or vague information of some involved data by means of interval-valued functions. To provide interval solutions to the inverse problems we have adopted a perturbed collage-based…
The Weak KAM theory was developed by Fathi in order to study the dynamics of convex Hamiltonian systems. It somehow makes a bridge between viscosity solutions of the Hamilton-Jacobi equation and Mather invariant sets of Hamiltonian systems,…
In this paper, we derive a Riccati-type equation applicable to (sub-)static Einstein spaces and examine its various applications. Specifically, within the framework of conformally compactifiable manifolds, we prove a splitting theorem for…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
We obtain variational formulas for holomorphic objects on Riemann surfaces with respect to arbitrary local coordinates on the moduli space of complex structures. These formulas are written in terms of a canonical object on the moduli space…
We study closed choice principles for different spaces. Given information about what does not constitute a solution, closed choice determines a solution. We show that with closed choice one can characterize several models of…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
The multivariate covering lemma states that given a collection of $k$ codebooks, each of sufficiently large cardinality and independently generated according to one of the marginals of a joint distribution, one can always choose one…
Weihrauch reducibility is a notion of reducibility between computational problems that is useful to calibrate the uniform computational strength of a multivalued function. It complements the analysis of mathematical theorems done in reverse…
We extend a study by Lempp and Hirst of infinite versions of some problems from finite complexity theory, using an intuitionistic version of reverse mathematics and techniques of Weihrauch analysis.
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…
In this paper, we propose a weak regularity principle which is similar to both weak K\"onig's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then…
We study the theta decomposition of Jacobi forms of nonintegral lattice index for a representation that arises in the theory of Weil representations associated to even lattices, and suggest possible applications.
A proof based on reduction to finite fields of Esnault-Viehweg's stronger version of Sommese Vanishing Theorem for $k$-ample line bundles is given. This result is used to give different proofs of isotriviality results of A. Parshin and L.…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
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…