Related papers: Elementary Complexity and von Neumann Algebras
Iterative refinement -- start with a random guess, then iteratively improve the guess -- is a useful paradigm for representation learning because it offers a way to break symmetries among equally plausible explanations for the data. This…
We construct explicit examples of half-sided modular inclusions ${\mathcal N}\subset{\mathcal M}$ of von Neumann algebras with trivial relative commutants. After stating a general criterion for triviality of the relative commutant in terms…
An inclusion of II$_1$ factors $N \subset M$ with finite Jones index gives rise to a powerful set of invariants that can be approached successfully in a number of different ways. We describe Jones' pictorial description of the standard…
For $\MvN$ a separable, purely infinite von Neumann algebra with almost periodic weight $\phi$, a decomposition of $\MvN$ as a crossed product of a semifinite von Neumann algebra by a trace--scaling action of a countable abelian group is…
We establish a connection between compactness of Hankel operators and geometry of the underlying domain through compactness multipliers for the $\overline{\partial}$-Neumann operator. In particular, we prove that any compactness multiplier…
We introduce a notion of planar algebra, the simplest example of which is a vector space of tensors, closed under planar contractions. A planar algebra with suitable positivity properties produces a finite index subfactor of a II_1 factor,…
In this paper, we develop a novel approach to the Weingarten calculus by employing the notion of virtual isometries. Traditionally, Weingarten calculus provides explicit formulas for integrating polynomial functions over compact matrix…
In the study of open quantum systems modeled by a unitary evolution of a bipartite Hilbert space, we address the question of which parts of the environment can be said to have a "classical action" on the system, in the sense of acting as a…
One approach to multivariate operator theory involves concepts and techniques from algebraic and complex geometry and is formulated in terms of Hilbert modules. In these notes we provide an introduction to this approach including many…
Bialgebroids, separable bialgebroids, and weak Hopf algebras are compared from a categorical point of view. Then properties of weak Hopf algebras and their applications to finite index and finite depth inclusions of von Neumann algebras are…
The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing…
Jolissaint and Stalder introduced definitions of mixing and weak mixing for von Neumann subalgebras of finite von Neumann algebras. In this note, we study various algebraic and analytical properties of subalgebras with these mixing…
Recently, we have shown that von Neumann algebras form a model for Selinger and Valiron's quantum lambda calculus. In this paper, we explain our choice of interpretation of the duplicability operator "!" by studying those von Neumann…
The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…
Matrix permanents arise naturally in the context of linear optical networks fed with nonclassical states of light. In this letter we tie the computational complexity of a class of multi-dimensional integrals to the permanents of large…
Starting from a (small) rigid C$^*$-tensor category $\mathscr{C}$ with simple unit, we construct von Neumann algebras associated to each of its objects. These algebras are factors and can be either semifinite (of type II$_1$ or II$_\infty$,…
Motivated by algorithmic information theory, the problem of program discovery can help find candidates of underlying generative mechanisms of natural and artificial phenomena. The uncomputability of such inverse problem, however,…
A notion of partial ideal for an operator algebra is a weakening the notion of ideal where the defining algebraic conditions are enforced only in the commutative subalgebras. We show that, in a von Neumann algebra, the ultraweakly closed…
We classify the possible Scott complexities for models of Peano arithmetic. We construct models of particular complexities by first giving a complete Scott analysis of colored linear orderings and constructing models of Peano arithmetic…
Using a family of graded algebra structures on a planar algebra and a family of traces coming from random matrix theory, we obtain a tower of non-commutative probability spaces, naturally associated to a given planar algebra. The associated…