Related papers: Effective subfactor theory

We observe that successive applications of known results from the theory of positive systems lead to an {\it efficient general algorithm} for positive realizations of transfer functions. We give two examples to illustrate the algorithm, one…

Suppose $p \geq 1$ is a computable real. We extend previous work of Clanin, Stull, and McNicholl by classifying the computable $L^p$ spaces whose underlying measure spaces are atomic but not purely atomic. In addition, we determine the…

We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…

The notion of weak truth-table reducibility plays an important role in recursion theory. In this paper, we introduce an elaboration of this notion, where a computable bound on the use function is explicitly specified. This elaboration…

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

We continue the investigation of analytic spaces from the perspective of computable structure theory. We show that if $p \geq 1$ is a computable real, and if $\Omega$ is a nonzero, non-atomic, and separable measure space, then every…

Explanations of cognitive behavior often appeal to computations over representations. What does it take for a system to implement a given computation over suitable representational vehicles within that system? We argue that the language of…

In intractable, undirected graphical models, an intuitive way of creating structured mean field approximations is to select an acyclic tractable subgraph. We show that the hardness of computing the objective function and gradient of the…

Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…

Algebraic effects are computational effects that can be described with a set of basic operations and equations between them. As many interesting effect handlers do not respect these equations, most approaches assume a trivial 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…

Motivated by our subfactor generalization of Wall's conjecture, in this paper we determine all intermediate subfactors for conformal subnets corresponding to four infinite series of conformal inclusions, and as a consequence we verify that…

Interpretability has arisen as a key desideratum of machine learning models alongside performance. Approaches so far have been primarily concerned with fixed dimensional inputs emphasizing feature relevance or selection. In contrast, we…

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…

Monads govern computational side-effects in programming semantics. They can be combined in a ''bottom-up'' way to handle several instances of such effects. Indexed monads and graded monads do this in a modular way. Here, instead, we equip…

In this paper we examine bases for finite index inclusion of $II_1$ factors and connected inclusion of finite dimensional $C^*$- algebras. These bases behave nicely with respect to basic construction towers. As applications we have studied…

Pervasive cross-section dependence is increasingly recognized as a characteristic of economic data and the approximate factor model provides a useful framework for analysis. Assuming a strong factor structure where $\Lop\Lo/N^\alpha$ is…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

According to mathematical constructivism, a mathematical object can exist only if there is a way to compute (or "construct") it; so, what is non-computable is non-constructive. In the example of the quantum model, whose Fock states are…

Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…