Decidability of flow equivalence and isomorphism problems for graph $C^*$-algebras and quiver representations
نویسندگان
چکیده
منابع مشابه
Flow Equivalence of Graph Algebras
This paper explores the effect of various graphical constructions upon the associated graph C∗-algebras. The graphical constructions in question arise naturally in the study of flow equivalence for topological Markov chains. We prove that outsplittings give rise to isomorphic graph algebras, and in-splittings give rise to strongly Morita equivalent C∗-algebras. We generalise the notion of a del...
متن کاملCluster Algebras and Quiver Representations
These notes contain an extended abstract and references for a minicourse given at the Summer School ‘Microlocal and Geometric Methods in Representation Theory’ (Schloss Reisensburg, July 2006) of the International Research Training Group Metz–Paderborn.
متن کاملcompactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولCluster Algebras, Quiver Representations and Triangulated Categories
This is an introduction to some aspects of Fomin-Zelevinsky’s cluster algebras and their links with the representation theory of quivers and with Calabi-Yau triangulated categories. It is based on lectures given by the author at summer schools held in 2006 (Bavaria) and 2008 (Jerusalem). In addition to by now classical material, we present the outline of a proof of the periodicity conjecture fo...
متن کاملGraph Algebras and Orbit Equivalence
We introduce the notion of orbit equivalence of directed graphs, following Matsumoto’s notion of continuous orbit equivalence for topological Markov shifts. We show that two graphs in which every cycle has an exit are orbit equivalent if and only if there is a diagonal-preserving isomorphism between their C∗-algebras. We show that it is necessary to assume that every cycle has an exit for the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2020
ISSN: 1088-6826,0002-9939
DOI: 10.1090/proc/15148