Zobrazeno 1 - 7
of 7
pro vyhledávání: '"FOX, ALEC"'
Autor:
Fox, Alec, Goldbring, Isaac
We characterize when a subfactor $N\subseteq M$ is oracle computable relative to a presentation of the ambient factor $M$ in terms of computability of the Jones basic construction, in terms of computable Pismner-Popa bases, and in terms of computabil
Externí odkaz:
http://arxiv.org/abs/2409.18831
Autor:
Burton, Peter, Eagle, Christopher J., Fox, Alec, Goldbring, Isaac, Harrison-Trainor, Matthew, McNicholl, Timothy H., Melnikov, Alexander, Thewmorakot, Teerawat
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.
Externí odkaz:
http://arxiv.org/abs/2402.16672
The Kirchberg Embedding Problem (KEP) asks if every C*-algebra embeds into an ultrapower of the Cuntz algebra $\mathcal{O}_2$. In an effort to provide a negative solution to the KEP and motivated by the recent refutation of the Connes Embedding Probl
Externí odkaz:
http://arxiv.org/abs/2303.02301
Autor:
Fox, Alec
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 word proble
Externí odkaz:
http://arxiv.org/abs/2206.01415
Publikováno v:
In Journal of Functional Analysis 15 December 2024 287(12)
Autor:
FOX, ALEC
Publikováno v:
Journal of Symbolic Logic; Sep2024, Vol. 89 Issue 3, p1313-1338, 26p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.