Centers of path algebras, Cohn and Leavitt path algebras

Irreducible representation-types of Leavitt path algebras

Irreducible representations of both Leavitt and Cohn path algebras of an arbitrary digraph with coefficients in a commutative field is classified. They are constructed in several ways using both infinite paths on the right as well as direct limits or factors of one-sided projective ideals of the ordinary quiver algebra, respectively. Furthermore, their defining relations are described, too, whence criterions are easily given when they are finitely presented or finite dimensional. Moreover, their endomorphism rings, annihilator primitive ideals are also computed directly. In particular, the car…

Graded chain conditions and Leavitt path algebras of no-exit graphs

We obtain a complete structural characterization of Cohn-Leavitt algebras over no-exit objects as graded involutive algebras. Corollaries of this result include graph-theoretic conditions characterizing when a Leavitt path algebra is a directed union of (graded) matricial algebras over the underlying field and over the algebra of Laurent polynomials and when the monoid of isomorphism classes of finitely generated projective modules is atomic and cancellative. We introduce the non-unital generalizations of graded analogues of noetherian and artinian rings, graded locally noetherian and graded l…

Leavitt路代数与图代数的代数熵一致

The algebraic entropies of the Leavitt path algebra and the graph algebras agree

本研究证明Leavitt路代数$L_K(E)$与图代数$KE$的代数熵（基于标准滤过）一致，论证依托全纯函数演算、熵与邻接矩阵范数的关系及Cohn路代数的界估计。

If $R^m \cong R^n$ must $m=n$?

A fundamental theorem of linear algebra asserts that every basis for the vector space $\mathbb{R}^n$ has $n$ elements. In this expository note we present a theorem of W. G. Leavitt describing one way in which this invariant basis number property can fail when one does linear algebra over rings, rather than over fields. We give a proof of Leavitt's theorem that combines ideas of P. M. Cohn and A. L. S. Corner into an elementary form requiring only a nodding acquaintance with matrices and modular arithmetic.

Centers of Leavitt path algebras and their completions

In [8, 9] M. G. Corrales Garcia, D. M. Barquero, C. Martin Gonzalez, M. Siles Molina, J. F Solanilla Hernandez described the center of a Leavitt path algebra and characterized it in terms of the underlying graph. We offer a different characterization of the center. In particular, we prove that the Boolean algebra of central idempotents \ of a Leavitt path algebra of a finite graph is isomorphic to the Boolean algebra of finitary annihilator hereditary subsets of the graph.

Canonical traces and directly finite Leavitt path algebras

Motivated by the study of traces on graph $C^*$-algebras, we consider traces (additive, central maps) on Leavitt path algebras, the algebraic counterparts of graph $C^*$-algebras. In particular, we consider traces which vanish on nonzero graded components of a Leavitt path algebra and refer to them as {\em canonical} since they are uniquely determined by their values on the vertices. A desirable property of a $\mathbb{C}$-valued trace on a $C^*$-algebra is that the trace of an element of the positive cone is nonnegative. We adapt this property to traces on a Leavitt path algebra $L_K(E)$ with …

Using the Steinberg algebra model to determine the center of any Leavitt path algebra

Given an arbitrary graph, we describe the center of its Leavitt path algebra over a commutative unital ring. Our proof uses the Steinberg algebra model of the Leavitt path algebra. A key ingredient is a characterization of compact open invariant subsets of the unit space of the graph groupoid in terms of the underlying graph: an open invariant subset is compact if and only if its associated hereditary and saturated set of vertices satisfies Condition (F). We also give a basis of the center. Its cardinality depends on the number of minimal compact open invariant subsets of the unit space.

Extreme cycles. The center of a Leavitt path algebra

In this paper we introduce new techniques in order to deepen into the structure of a Leavitt path algebra with the aim of giving a description of the center. Extreme cycles appear for the first time; they concentrate the purely infinite part of a Leavitt path algebra and, jointly with the line points and vertices in cycles without exits, are the key ingredients in order to determine the center of a Leavitt path algebra. Our work will rely on our previous approach to the center of a prime Leavitt path algebra \cite{CMMSS1}. We will go further into the structure itself of the Leavitt path algebr…

The center of a Kumjian-Pask algebra

The Kumjian-Pask algebras are path algebras associated to higher-rank graphs, and generalize the Leavitt path algebras. We study the center of simple Kumjian-Pask algebras and characterize commutative Kumjian-Pask algebras.

图代数的协变函子性

The covariant functoriality of graph algebras

通过引入图的路径同态构建环境范畴，确定了到路径代数等代数范畴的协变函子，为揭示Leavitt path algebras同态提供新工具，并证明了顶点单环均有出口的任意图的混合拉回定理。

Simplicity of Leavitt path algebras via graded ring theory

Suppose that $R$ is an associative unital ring and that $E=(E^0,E^1,r,s)$ is a directed graph. Utilizing results from graded ring theory we show, that the associated Leavitt path algebra $L_R(E)$ is simple if and only if $R$ is simple, $E^0$ has no nontrivial hereditary and saturated subset, and every cycle in $E$ has an exit. We also give a complete description of the center of a simple Leavitt path algebra.

与图相关的环的秩条件和可均性

Rank conditions and amenability for rings associated to graphs

研究有向图对应的路径环、Cohn路径环和Leavitt路径环，给出当系数环R满足秩条件或强秩条件时，图需满足的充要条件，并应用于刻画可均路径代数的图。

Topological Graph Inverse Semigroups

To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path algebras, Cohn path algebras, Cuntz-Krieger $C^*$-algebras, and Toeplitz $C^*$-algebras. We investigate topologies that turn $G(E)$ into a topological semigroup. For instance, we show that in any such topology that is Hausdorff, $G(E)\setminus \{0\}$ must be discrete for any directed graph $E$. On the other hand, $G(E)$ need not be discrete in a Hausdorff semi…