Related papers: Elementary Complexity and von Neumann Algebras
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…
These notes provide an explanation of the type classification of von Neumann algebras, which has made many appearances in recent work on entanglement in quantum field theory and quantum gravity. The goal is to bridge a gap in the literature…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
It is shown that each linear operator on a separable Hilbert space which generates a finite type I von Neumann algebra has, up to unitary equivalence, a unique representation as a direct integral of inflations of mutually unitary…
We consider commuting squares of finite dimensional von Neumann algebras having the algebra of complex numbers in the lower left corner. Examples include the vertex models, the spin models (in the sense of subfactor theory) and the…
We study the complexity of the classification problem for Cartan subalgebras in von Neumann algebras. We construct a large family of II$_1$ factors whose Cartan subalgebras up to unitary conjugacy are not classifiable by countable…
We explain how recent developments in the fields of realisability models for linear logic -- or geometry of interaction -- and implicit computational complexity can lead to a new approach of implicit computational complexity. This…
We survey the developments in the model theory of tracial von Neumann algebras that have taken place in the last fifteen years. We discuss the appropriate first-order language for axiomatizing this class as well as the subclass of II$_1$…
A novel algebra underlying integrable systems is shown to generate and unify a large class of quantum integrable models with given $R$-matrix, through reductions of an ancestor Lax operator and its different realizations. Along with known…
In this paper we examine an inverse problem in the modular theory of von Neumann algebras in the case of finite factors. First we give a characterization of cyclic and separating vectors for finite factors in terms of operators associated…
We introduce "embedding dimensions" of a family of generators of a finite von Neumann algebra when the von Neumann algebra can be faithfully embedded into the ultrapower of the hyperfinite II$_1$ factor. These embedding dimensions are von…
Let M be a von Neumann algebra of type II_1 which is also a complemented subspace of B(H). We establish an algebraic criterion, which ensures that M is an injective von Neumann algebra. As a corollary we show that if M is a complemented…
We observe how a classical model-theoretic fact proves the existence of many strong amalgamation bases for the class of R^\omega-embeddable von Neumann algebras, where R is the hyperfinite II_1 factor. In particular, we shows that R itself…
We introduce a framework for online structure theory. Our approach generalises notions arising independently in several areas of computability theory and complexity theory. We suggest a unifying approach using operators where we allow the…
We define a canonical relative commutant planar algebra from a strongly Markov inclusion of finite von Neumann algebras. In the case of a connected unital inclusion of finite dimensional C*-algebras with the Markov trace, we show this…
We propose a framework for reasoning about programs that manipulate coinductive data as well as inductive data. Our approach is based on using equational programs, which support a seamless combination of computation and reasoning, and using…
Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than using external measure. We survey how automata theory…
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (``universal probability'') as a starting point, and define complexity (an operator) as its negative logarithm. A number of…
We study conjugacy orbits of certain types of subalgebras in tracial von Neumann algebras. For any separable II$_1$ factor $N_0$ we construct a highly indecomposable non Gamma II$_1$ factor $N$ such that $N_0 \subset N$ and moreover every…
The decompositions of an element of a finite von Neumann algebra into the sum of a normal operator plus an s.o.t.-quasinilpotent operator, obtained using the Haagerup--Schultz hyperinvariant projections, behave well with respect to…