Row-finite equivalents exist only for row-countable graphs.

DOI10.1090/CONM/562/11126MaRDI QIDQ2895451zbMATH OpenOpenAlexFDO

Authors Gene Abrams, Kulumani M. Rangaswamy

Publication date 2 July 2012

Published in New Trends in Noncommutative Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0904.0183

zbMATH Keywords

Leavitt path algebrasdesingularizationsMorita equivalencesrow-finite graphs

Mathematics Subject Classification ID

General theory of (C^*)-algebras (46L05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structure and classification for modules, bimodules and ideals (except as in 16Gxx), direct sum decomposition and cancellation in associative algebras) (16D70) Representations of quivers and partially ordered sets (16G20) Endomorphism rings; matrix rings (16S50) Automorphisms and endomorphisms (16W20)

Abstract: If $E$ is a not-necessarily row-finite graph, such that each vertex of $E$ emits at most countably many edges, then a {it desingularization} $F$ of $E$ can be constructed (see e.g. (1) G. Abrams, G. Aranda Pino, Leavitt path algebras of arbitrary graphs, Houston J. Math 34(2) (2008), 423-442, or (2) I. Raeburn, "Graph algebras". CBMS Regional Conference Series in Mathematics 103, Conference Board of the Mathematical Sciences, Washington, DC, 2005, ISBN 0-8218-3660-9). The desingularization process has been effectively used to establish various characteristics of the Leavitt path algebras of not-necessarily row-finite graphs. Such a desingularization $F$ of $E$ has the properties that: (1) $F$ is row-finite, and (2) the Leavitt path algebras $L(E)$ and $L(F)$ are Morita equivalent. We show here that for an arbitrary graph $E$, a graph $F$ having properties (1) and (2) exists (we call such a graph $F$ a emph{row-finite equivalent of} $E$) if and only if $E$ is row-countable; that is, $E$ contains no vertex $v$ for which $v$ emits uncountably many edges.

Recommendations

• Classification of unital simple Leavitt path algebras of infinite graphs.
• SUBSETS OF VERTICES GIVE MORITA EQUIVALENCES OF LEAVITT PATH ALGEBRAS
• Chain conditions for Leavitt path algebras
• Morita equivalence and Morita invariant properties: applications in the context of Leavitt path algebras

Cited in

(6)

• Realizing corners of Leavitt path algebras as Steinberg algebras, with corresponding connections to graph \(C^{\ast}\)-algebras
• Generalized Regularity Conditions for Leavitt Path Algebras over Arbitrary Graphs
• Graph algebras and the Gelfand-Kirillov dimension
• Morita equivalence and Morita invariant properties: applications in the context of Leavitt path algebras
• Leavitt path algebras: the first decade.
• Leavitt \(R\)-algebras over countable graphs embed into \(L_{2,R}\).

This page was built for publication: Row-finite equivalents exist only for row-countable graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895451)