Related papers: Computable presentations of C*-algebras

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

In this note, we investigate how different fundamental groups of presentations of a fixed algebra $A$ can be. For finitely many finitely presented groups $G_i$, we construct an algebra $A$ such that all $G_i$ appear as fundamental groups of…

For a long time, practitioners of the art of operator algebras always worked over the complex numbers, and nobody paid much attention to real C*-algebras. Over the last thirty years, that situation has changed, and it's become apparent that…

We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…

We establish the Borel computability of various C$^*$-algebra invariants, including the Elliott invariant and the Cuntz semigroup. As applications we deduce that AF algebras are classifiable by countable structures, and that a conjecture of…

We give an order-theoretic characterization of the essential image of the forgetful functor from the category of real/complex unital C*-algebras to the category of real/complex unital operator systems. It is based on the characterization of…

C*-algebras are rings, sometimes nonunital, obeying certain axioms that ensure a very well-behaved representation theory upon Hilbert space. Moreover, there are some well-known features of the representation theory leading to subtle…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

We prove a general result on presentations of finitely-generated algebras and apply it to obtain nice presentations for some noncommutative algebras arising in the matrix bispectral problem. By "nice presentation" we mean a presentation…

Universal continuous calculi are defined and it is shown that for every finite tuple of pairwise commuting Hermitian elements of a Su*-algebra (an ordered *-algebra that is symmetric, i.e. "strictly" positive elements are invertible, and…

We give two characterizations of tracially nuclear C*-algebras. The first is that the finite summand of the second dual is hyperfinite. The second is in terms of a variant of the weak* uniqueness property. The necessary condition holds for…

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…

We study the C*-algebra crossed-product of the closed unit disk by the action of one of its conformal automorphisms. After classifying the conformal automorphisms up to topological conjugacy, we investigate, for each class, the irreducible…

We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…

A classification is given of certain separable nuclear C*-algebras not necessarily of real rank zero, namely, the class of separable simple C*-algebras which are inductive limits of continuous-trace C*-algebras whose building blocks have…

We show that semiprojectivity of a C*-algebra is preserved when passing to C*-subalgebras of finite codimension. In particular, any pullback of two semiprojective C*-algebras over a finite-dimensional C*-algebra is again semiprojective.

The aim of this lecture is to present the concept of C-algebra and to illustrate its applications in two contexts: the study of reflection groups and their folding on the one hand, the structure of rational conformal field theories on the…

We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…

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…

We consider the functor C that to a unital C*-algebra A assigns the partial order set C(A) of its commutative C*-subalgebras ordered by inclusion. We investigate how some C*-algebraic properties translate under the action of C to…