Related papers: Enforceable operator algebras

We define the notion of self-tracial stability for tracial von Neumann algebras and show that a tracial von Neumann algebra satisfying the Connes Embedding Problem is self-tracially stable if and only if it is amenable. We then generalize a…

In this paper, a condition making vertex operator superalgebras to be unitary is determined and an analogue of conformal spin-statistics theorem in conformal field theory is proved. As an application of these results, it is proved that…

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

Several authors have considered whether the ultrapower and the relative commutant of a C*-algebra or II_1 factor depend on the choice of the ultrafilter. We settle each of these questions, extending results of Ge-Hadwin and the first…

Inference algorithms for probabilistic programming are complex imperative programs with many moving parts. Efficient inference often requires customising an algorithm to a particular probabilistic model or problem, sometimes called…

We study the properties of shifted vertex operator algebras, which are vertex algebras derived from a given theory by shifting the conformal vector. In this way, we are able to exhibit large numbers of vertex operator algebras which are…

We define an extension of operator-valued positive definite functions from the real or complex setting to topological algebras, and describe their associated reproducing kernel spaces. The case of entire functions is of special interest,…

We first establish some general results connecting real and complex Lie algebras of first-order differential operators. These are applied to completely classify all finite-dimensional real Lie algebras of first-order differential operators…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

This paper is to study vertex operator superalgebras which are strongly generated by their weight-$2$ and weight-$\frac{3}{2}$ homogeneous subspaces. Among the main results, it is proved that if such a vertex operator superalgebra $V$ is…

When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…

We prove a continuous-parameter version of the recent theorem of Katznelson-Tzafiri type for power-bounded operators which have a bounded calculus for analytic Besov functions. We also show that the result can be extended to some operators…

In this paper we solve the satisfiability problem of an extended fragment of set computable theory which "forces the infinity" by a fruitful use of the witness small model property and the theory of formative processes.

We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…

We study a natural measurable selection problem for which the standard uniformisation theorems do not seem to apply directly, yet a Borel selector exists. More precisely, we consider families of finite dimensional functions that admit…

Given a lattice $\mathbb{L}$ and a class $K$ of algebraic structures, we say that $\mathbb{L}$ \emph{forces nilpotency} in $K$ if every algebra $\mathbf{A} \in K$ whose congruence lattice $\mathrm{Con} (\mathbf{A})$ is isomorphic to…

An often used model for quantum theory is to associate to every physical system a C*-algebra. From a physical point of view it is unclear why operator algebras would form a good description of nature. In this paper, we find a set of…

In vertex operator algebra theories, most of the general theorems are proved under the assumptions of rationality and C_2-cofiniteness. In this paper, we obtain several general theorems without the assumption of rationality so that we can…

We introduce the notion of amenability for affine algebras. We characterize amenability by Folner-sequences, paradoxicality and the existence of finitely invariant dimension-measures. Then we extend the results of Rowen on ranks, from…

If $\fg$ is a semisimple Lie algebra, we describe the prime factors of $\mcU(\fg)$ that have enough finite dimensional modules. The proof depends on some combinatorial facts about the Weyl group which may be of independent interest. We also…