Related papers: A computability-theoretic reformulation of the Con…

For a compact quantum group $\mathbb G$ of Kac type, we study the existence of a Haar trace-preserving embedding of the von Neumann algebra $L^\infty(\mathbb G)$ into an ultrapower of the hyperfinite II$_1$-factor (the Connes embedding…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

In this paper, we prove that if $\mathcal{A}$ is a unital separable $C^*$-algebra, $\mathcal{M}$ is a von Neumann algebra which has the Kirchberg's quotient weak expectation property (QWEP), and $\phi:\, \mathcal{A}\rightarrow \mathcal{M}$…

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

We show that there exists a completely bounded (c.b. in short) homomorphism $u$ from a $C^*$-algebra $C$ with the lifting property (in short LP) into a QWEP von Neumann algebra $N$ that is not strongly similar to a $*$-homomorphism, i.e.…

We consider various statements that characterize the hyperfinite II$_1$ factors amongst embeddable II$_1$ factors in the non-embeddable situation. In particular, we show that "generically" a II$_1$ factor has the Jung property (which states…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

We study embeddings between reproducing kernel Hilbert spaces $H(K)$ of functions of $d \in \mathbb{N} \cup \{\infty\}$ variables. The kernels $K$ are superpositions of weighted finite tensor products of a fixed univariate kernel. The basic…

We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…

We prove that every positive trace on a countably generated *-algebra can be approximated by positive traces on algebras of generic matrices. This implies that every countably generated tracial *-algebra can be embedded into a metric…

Using a theorem from pcf theory, we show that for any singular cardinal nu, the product of the Cohen forcing notions on kappa, kappa < nu adds a generic for the Cohen forcing notion on nu^+. This solves Problem 5.1 in Miller's list…

This is an expanded lecture note for "Masterclass on sofic groups and applications to operator algebras" (University of Copenhagen, 5-9 November 2012). It is about algebraic aspects of the Connes Embedding Conjecture. It contains new proofs…

We investigate certain classes of normal completely positive (CP) maps on the hyperfinite $II_1$ factor $\mathcal A$. Using the representation theory of a suitable irrational rotation algebra, we propose some computable invariants for such…

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the…

We investigate completions of partial combinatory algebras (pcas), in particular of Kleene's second model $\mathcal{K}_2$ and generalizations thereof. We consider weak and strong notions of embeddability and completion that have been…

We say that a $C^*$-algebra $\mathcal{A}$ satisfies the similarity property ((SP)) if every bounded homomorphism $u\colon \mathcal{A} \to \mathcal{B}(\mathit{H})$, where $\mathit{H}$ is a Hilbert space, is similar to a $*$-homomorphism. We…

The linear complementarity problem (LCP) is a general set membership problem that includes quadratic cone programming as a special case. In this work we consider a homogeneous embedding of the LCP, which encodes both the optimality…

This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory…

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…

Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…