Related papers: Two-Sided Ideals in Leavitt Path Algebras
Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…
In this paper we focus on the structure of the variety of Lie algebras with a finite number of ideals and their graph representations using Hasse diagrams. The large number of necessary conditions on the algebraic structure of this type of…
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…
Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gr\"obner bases and are radical if only if the graph is bipartite or the characteristic of the ground field is…
When $\Gamma$ is a row-finite di(rected )graph we classify all finite dimensional modules of the Leavitt path algebra $L(\Gamma)$ via an explicit Morita equivalence given by an effective combinatorial (reduction) algorithm on the digraph…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
The stable rank of Leavitt path algebras of row-finite graphs was computed by Ara and Pardo. In this paper we extend this for an arbitrary directed graph. In some parts, we proceed our computation as the row-finite case while in some parts…
We continue a very fruitful line of inquiry into the multiplicative ideal theory of an arbitrary Leavitt path algebra L. Specifically, we show that factorizations of an ideal in L into irredundant products or intersections of finitely many…
We study representations of a Leavitt path algebra $L$ of a finitely separated digraph $\Gamma$ over a field. We show that the category of $L$-modules is equivalent to a full subcategory of quiver representations. When $\Gamma$ is a…
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…
We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…
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…
A multi-relational graph maintains two or more relations over a vertex set. This article defines an algebra for traversing such graphs that is based on an $n$-ary relational algebra, a concatenative single-relational path algebra, and a…
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
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…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
Given a finite connected bipartite graph, finite-dimensional indecomposable semisimple Leibniz algebras are constructed. Furthermore, any finite-dimensional indecomposable semisimple Leibniz algebra admits a similar construction.
Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_1, \ldots, x_n\}$ and $I(G) \subset K[V(G)]$ its edge ideal, where $K[V(G)]$ is the polynomial ring in $x_1, \ldots, x_n$ over a field $K$ with each ${\rm deg} x_i = 1$ and…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…