Related papers: Computable Aspects of the Bachmann-Howard Principl…
We present a short analytic proof of the equality between the analytic and combinatorial torsion. We use the same approach as in the proof given by Burghelea, Friedlander and Kappeler, but avoid using the difficult Mayer-Vietoris type…
The Solvability Complexity Index (SCI) provides an extensional limit-height formalism for recovering a target map $\Xi$ from finite samples of an evaluation interface $\Lambda\subseteq\mathbb C^\Omega$ by finite-height towers of pointwise…
We introduce a simplified (coarse) version of pseudo-differential calculus for operators of order zero on complete Riemannian manifolds. This calculus works for the usual Hormander (1,0) class of operators, as well as for…
In the present paper, we aim to introduce the cohomology of $\mathcal{O}$-operators defined on the Hom-Lie conformal algebra concerning the given representation. To obtain the desired results, we describe three different cochain complexes…
We prove a computable version of the Hall Harem Theorem where the matching realizes a unary function with controlled sizes of cycles. We apply it to non-amenable computable coarse spaces. As a result, we obtain a computable version of the…
We define a reduced $\infty$-operad $\mathcal{P}$ to be $d$-connected if the spaces $\mathcal{P}\left(n\right)$, of $n$-ary operations, are $d$-connected for all $n\ge0$. Let $\mathcal{P}$ and $\mathcal{Q}$ be two reduced $\infty$-operads.…
The measurable Riemann mapping theorem proved by Morrey and in some particular cases by Ahlfors, Lavrentiev and Vekua, says that any measurable almost complex structure on $\rd$ ($S^2$) with bounded dilatation is integrable: there is a…
We explore aspects of dilation theory in the finite dimensional case and show that for a commuting $n$-tuple of operators $T=(T_1,...,T_n) $ acting on some finite dimensional Hilbert space $H$ and a compact set $X\subset \mathbb{C}^n$ the…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
We consider a class of quasi-integrable Hamiltonian systems obtained by adding to a non-convex Hamiltonian function of an integrable system a perturbation depending only on the angle variables. We focus on a resonant maximal torus of the…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
By a theorem of Bayart, $\varphi$ generates a bounded composition operator on the Hardy space $\Hp$of Dirichlet series ($1\le p<\infty$) only if $\varphi(s)=c_0 s+\psi(s)$, where $c_0$ is a nonnegative integer and $\psi$ a Dirichlet series…
We consider characterisations of unitary dilations and approximations of irreversible classical dynamical systems on a Hilbert space. In the commutative case, building on the work in [9], one can express well known approximants (e.g. Hille-…
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 show that any finite dimensional von Neumann algebra admits an orthonormal unitary basis with respect to its standard trace. We also show that a finite dimensional von Neumann subalgebra of $M_n(\mathbb{C})$ admits an orthonormal unitary…
We introduce an axiomatization for the notion of computation. Based on the idea of Brouwer choice sequences, we construct a model, denoted by $E$, which satisfies our axioms and $E \models \mathrm{ P \neq NP}$. In other words, regarding…
Let $X=(X(n))_{n \in \mathbb{Z_+}}$ be a standard subproduct system of $C^*$-correspondences over a $C^*$-algebra $\mathcal M.$ Assume $T=(T_n)_{n \in \mathbb{Z_+}}$ to be a pure completely contractive, covariant representation of $X$ on a…
We consider a class of formula equations in first-order logic, Horn formula equations, which are defined by a syntactic restriction on the occurrences of predicate variables. Horn formula equations play an important role in many…
This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by…
We propose the notion of countable decomposability of maps on C*-algebras: a bounded linear map $\varphi : \mathscr{A}\to B(\mathcal{H})$, where $\mathscr{A}$ is a C*-algebra and $\mathcal{H}$ a Hilbert space, will be called countably…