Related papers: How incomputable is the separable Hahn-Banach theo…
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
Formulae of the Lambek calculus are constructed using three binary connectives, multiplication and two divisions. We extend it using a unary connective, positive Kleene iteration. For this new operation, following its natural…
We introduce an operator on problems in Weihrauch complexity, which we call the inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a…
It is shown that any Hermitian operator can be expanded in terms of a set of operators formed from biorthogonal basis, and the expansion coefficients are given as products of weight functions and weak values, shedding a new light on the…
This note aims to highlight the link between representable functionals and derivations on a Banach quasi *-algebra, i.e. a mathematical structure that can be seen as the completion of a normed *-algebra in the case the multiplication is…
We show that every modular category is equivalent as an additive ribbon category to the category of finite-dimensional comodules of a Weak Hopf Algebra. This Weak Hopf Algebra is finite-dimensional, split cosemisimple, weakly…
We investigate the representation theory of a large class of pointed Hopf algebras, extending results of Lusztig and others. We classify all simple modules in a suitable category and determine the weight multiplicities; we establish a…
In this paper, we introduce and investigate the concepts of cyclically weakly amenable and point amenable. Then, we compare these concepts with the concepts of weakly amenable and cyclically amenable and find the relation between them. For…
We develop a systematic algorithmic framework that unites global and local classification problems using index sets. We prove that the classification problem for continuous (binary) regular functions among almost everywhere linear,…
We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…
In the present paper we extend the multiplicative integral to complex-valued functions of complex variable. The main difficulty in this way, that is the multi-valued nature of the complex logarithm, is avoided by division of the interval of…
We study $\mathbb Z$-graded modules of nonzero level with arbitrary weight multiplicities over Heisenberg Lie algebras and the associated generalized loop modules over affine Kac-Moody Lie algebras. We construct new families of such…
Martin-L\"of (ML)-reducibility compares $K$-trivial sets by examining the Martin-L\"of random sequences that compute them. We show that every $K$-trivial set is computable from a c.e.\ set of the same ML-degree. We investigate the interplay…
We investigate wether three statements in analysis, that can be proved classically, are realizable in the realizability model of extensional continuous functionals induced by Kleene's second model $K_2$. We prove that a formulation of the…
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…
Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…
Fekete's lemma is a well known result from combinatorial mathematics that shows the existence of a limit value related to super- and subadditive sequences of real numbers. In this paper, we analyze Fekete's lemma in view of the arithmetical…