Leavitt path algebras and direct limits
classification
🧮 math.RA
keywords
algebrascharacterizationsdirectgraphsleavittpathresultsarbitrary
read the original abstract
An introduction to Leavitt path algebras of arbitrary directed graphs is presented, and direct limit techniques are developed, with which many results that had previously been proved for countable graphs can be extended to uncountable ones. Such results include characterizations of simplicity, characterizations of the exchange property, and cancellation conditions for the K-theoretic monoid of equivalence classes of idempotent matrices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.