Stable rank of Leavitt path algebras

We characterize the values of the stable rank for Leavitt path algebras by giving concrete criteria in terms of properties of the underlying graph.

     

FP-injective semirings,semigroup rings and Leavitt path algebras

In this paper we give characterisations of FP-injective semirings (previously termed “exact” semirings in work of the first author). We provide a basic connection between FP-injective semirings and P-injective semirings, and establish that FP-injectivity of semirings is a Morita invariant property. We show that the analogue of the Faith-Menal conjecture (relating FP-injectivity and self-injectivity for rings satisfying certain chain conditions) does not hold for semirings. We prove that the semigroup ring of a locally finite inverse monoid over an FP-injective ring is FP-injective and give a criterion for the Leavitt path algebra of a finite graph to be FP-injective.     

The structure of Leavitt path algebras and the Invariant Basis Number property

In this paper, we provide the structure of the Leavitt path algebra of a finite graph via some step-by-step process of source eliminations, and restate Kanuni and Özaydin's nice criterion for Leavitt path algebras of finite graphs having Invariant Basis Number via matrix-theoretic language. Consequently, we give a matrix-theoretic criterion for the Leavitt path algebra of a finite graph having Invariant Basis Number in terms of a sequence of source eliminations. Using these results, we show certain classes of finite graphs for which Leavitt path algebras have Invariant Basis Number, as well as investigate the Invariant Basis Number property of Leavitt path algebras of certain Cayley graphs of finite groups.     

Simple flat Leavitt path algebras are von Neumann regular

For a unital ring, it is an open question whether flatness of simple modules implies all modules are flat and thus the ring is von Neumann regular. The question was raised by Ramamurthi over 40?years ago who called such rings SF-rings (i.e. simple modules are flat). In this note we show that an SF Steinberg algebra of an ample Hausdorff groupoid, graded by an ordered group, has an aperiodic unit space. For graph groupoids, this implies that the graphs are acyclic. Combining with the Abrams–Rangaswamy Theorem, it follows that SF Leavitt path algebras are regular, answering Ramamurthi’s question in positive for the class of Leavitt path algebras.     

Graded irreducible representations of Leavitt path algebras: A new type and complete classification

We present a new class of graded irreducible representations of a Leavitt path algebra. This class is new in the sense that its representation space is not isomorphic to any of the existing simple Chen modules. The corresponding graded simple modules complete the list of Chen modules which are graded, creating an exhaustive class: the annihilator of any graded simple module is equal to the annihilator of either a graded Chen module or a module of this new type.Our characterization of graded primitive ideals of a Leavitt path algebra in terms of the properties of the underlying graph is the main tool for proving the completeness of such classification. We also point out a problem with the characterization of primitive ideals of a Leavitt path algebra in Rangaswamy (2013) [15].     

Realizing ultragraph Leavitt path algebras as Steinberg algebras

In this article, we realize the finite range ultragraph Leavitt path algebras as Steinberg algebras. This realization allows us to use the groupoid approach to obtain structural results about these algebras. Using the skew product of groupoids, we show that ultragraph Leavitt path algebras are graded von Neumann regular rings. We characterize strongly graded ultragraph Leavitt path algebras and show that every ultragraph Leavitt path algebra is semiprimitive. Moreover, we characterize irreducible representations of ultragraph Leavitt path algebras. We also show that ultragraph Leavitt path algebras can be realized as Cuntz-Pimsner rings.     

Bases of Leavitt path algebras with only strongly regular elements

Recent articles consider invertible and locally invertible algebras (respectively, those having a basis consisting solely of invertible or solely of strongly regular elements). Previous contributions to the subject include the study of when Leavitt path algebras are invertible. This article investigates the local invertibility property in Leavitt path algebras. A complete classification of strongly regular monomials in Leavitt path algebras is given. Additionally, it is show that all directly finite and (von Neumann) regular Leavitt path algebras are locally invertible. It is also shown that a Leavitt path algebra has a basis consisting solely of strongly regular monomials if and only if it is commutative.     

On the Simplicity of Lie Algebras Associated to Leavitt Algebras

For any field 𝕂 and integer n ≥ 2, we consider the Leavitt algebra L _𝕂(n); for any integer d ≥ 1, we form the matrix ring S = M _d (L _𝕂(n)). S is an associative algebra, but we view S as a Lie algebra using the bracket [a, b] = ab ? ba for a, b ∈ S. We denote this Lie algebra as S ^?, and consider its Lie subalgebra [S ^?, S ^?]. In our main result, we show that [S ^?, S ^?] is a simple Lie algebra if and only if char(𝕂) divides n ? 1 and char(𝕂) does not divide d. In particular, when d = 1, we get that [L _𝕂(n)^?, L _𝕂(n)^?] is a simple Lie algebra if and only if char(𝕂) divides n ? 1.     

On the Simplicity of the Lie Algebra of a Leavitt Path Algebra

For a field F and a row-finite directed graph Γ, let L(Γ) be the associated Leavitt path algebra. We find necessary and sufficient conditions for the Lie algebra [L(Γ), L(Γ)] to be simple.     

Simplicity of the Lie Algebra of Skew Symmetric Elements of a Leavitt Path Algebra

For a field F of characteristic not 2 and a directed row-finite graph Γ let L(Γ) be the Leavitt Path Algebra with standard involution *. We study the lie algebra of K = K(L(Γ), *) of * ?skew-symmetric elements and find necessary and sufficient conditions for the Lie algebra [K, K] to be simple.     

三正则连通图的Cordial性

用调整顶点标号的方法确定了3正则连通图的Cordial性．     

Baer and Baer *-ring characterizations of Leavitt path algebras

We characterize Leavitt path algebras which are Rickart, Baer, and Baer ?-rings in terms of the properties of the underlying graph. In order to treat non-unital Leavitt path algebras as well, we generalize these annihilator-related properties to locally unital rings and provide a more general characterizations of Leavitt path algebras which are locally Rickart, locally Baer, and locally Baer ?-rings. Leavitt path algebras are also graded rings and we formulate the graded versions of these annihilator-related properties and characterize Leavitt path algebras having those properties as well.Our characterizations provide a quick way to generate a wide variety of examples of rings. For example, creating a Baer and not a Baer ?-ring, a Rickart ?-ring which is not Baer, or a Baer and not a Rickart ?-ring, is straightforward using the graph-theoretic properties from our results. In addition, our characterizations showcase more properties which distinguish behavior of Leavitt path algebras from their $C^{?}$-algebra counterparts. For example, while a graph $C^{?}$-algebra is Baer (and a Baer ?-ring) if and only if the underlying graph is finite and acyclic, a Leavitt path algebra is Baer if and only if the graph is finite and no cycle has an exit, and it is a Baer ?-ring if and only if the graph is a finite disjoint union of graphs which are finite and acyclic or loops.     

Small regular graphs having the same path layer matrix*

The path layer matrix of graph G contains quantitative information about all paths in G. The entry (i,j) in this matrix is the number of simple paths in G having initial vertex i and length j. Some new upper bounds for r‐regular graphs with the same path layer matrix are presented for r=4, 5, 6. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 219–221, 2002; DOI 10.1002/jgt.10005     

Ideal Structure of Leavitt Path Algebras with Coefficients in a Unital Commutative Ring

For a (countable) graph E and a unital commutative ring R, we analyze the ideal structure of the Leavitt path algebra L _R (E) introduced by Mark Tomforde. We first modify the definition of basic ideals and then develop the ideal characterization of Mark Tomforde. We also give necessary and sufficient conditions for the primeness and the primitivity of L _R (E), and we then determine prime graded basic ideals and left (or right) primitive graded ideals of L _R (E). In particular, when E satisfies Condition (K) and R is a field, they imply that the set of prime ideals and the set of primitive ideals of L _R (E) coincide.     

Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles

For any graph $G$ with $a,b\in V\left(G\right)$, a shortest path reconfiguration graph can be formed with respect to $a$ and $b$; we denote such a graph as $S(G,a,b)$. The vertex set of $S(G,a,b)$ is the set of all shortest paths from $a$ to $b$ in $G$ while two vertices $U,W$ in $V\left(S(G,a,b)\right)$ are adjacent if and only if the vertex sets of the paths that represent $U$ and $W$ differ in exactly one vertex. In a recent paper (Asplund et al., 2018), it was shown that shortest path graphs with girth five or greater are exactly disjoint unions of even cycles and paths. In this paper, we extend this result by classifying all shortest path graphs with no induced 4-cycles.     

Regular path decompositions of odd regular graphs

Kotzig asked in 1979 what are necessary and sufficient conditions for a d‐regular simple graph to admit a decomposition into paths of length d for odd d>3. For cubic graphs, the existence of a 1‐factor is both necessary and sufficient. Even more, each 1‐factor is extendable to a decomposition of the graph into paths of length 3 where the middle edges of the paths coincide with the 1‐factor. We conjecture that existence of a 1‐factor is indeed a sufficient condition for Kotzig's problem. For general odd regular graphs, most 1‐factors appear to be extendable and we show that for the family of simple 5‐regular graphs with no cycles of length 4, all 1‐factors are extendable. However, for d>3 we found infinite families of d‐regular simple graphs with non‐extendable 1‐factors. Few authors have studied the decompositions of general regular graphs. We present examples and open problems; in particular, we conjecture that in planar 5‐regular graphs all 1‐factors are extendable. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 114–128, 2010     

一类具有最大末块数和割点数的4-正则图

图G的一个顶点称为割点是指删去该顶点,图的分支数增加,而图G的一个末块是指仅包含G的一个割点的块.对无爪且不含4-团的4-正则图,给出了它的末块数与割点数的上界且刻划了达到这些上界的极值图.     

Characterizing directed path graphs by forbidden asteroids

An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central role in a classical characterization of interval graphs by Lekkerkerker and Boland. Their result says that a chordal graph is an interval graph if and only if it does not contain an asteroidal triple. In this paper, we prove an analogous theorem for directed path graphs which are the intersection graphs of directed paths in a directed tree. For this purpose, we introduce the notion of a special connection. Two non‐adjacent vertices are linked by a special connection if either they have a common neighbor or they are the endpoints of two vertex‐disjoint chordless paths satisfying certain conditions. A special asteroidal triple is an asteroidal triple such that each pair is linked by a special connection. We prove that a chordal graph is a directed path graph if and only if it does not contain a special asteroidal triple. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:103‐112, 2011