相关论文: On a class of algebras associated to directed grap…
We give a homological interpretation of the coefficients of the Hilbert series for an algebra associated with a directed graph and its dual algebra. This allows us to obtain necessary conditions for Koszulity of such algebras in terms of…
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…
Leavitt path algebras associate to directed graphs a $\mathbb Z$-graded algebra and in their simplest form recover the Leavitt algebras L(1,n). In this note, we introduce iterated Leavitt path algebras associated to directed weighted graphs…
We investigate the notion of associated graded coalgebra (algebra) of a bialgebra with respect to a subbialgebra (quotient bialgebra) and characterize those which are bialgebras of type one in the framework of abelian braided monoidal…
The space of derivations of finite dimensional evolution algebras associated to graphs over a field with characteristic zero has been completely characterized in the literature. In this work we generalize that characterization by describing…
Leavitt path algebras are free algebras subject to relations induced by directed graphs. This paper investigates the ideals of Leavitt path algebras, with an emphasis on the relationship between graph-theoretic properties of a directed…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
A characterization is given for directed graphs that yield graph $C^*$-algebras with continuous trace. This is established for row-finite graphs with no sources first using a groupoid approach, and extended to the general case via the…
An oriented graph is said positively multiplicative when its adjacency matrix $A$ embeds in a matrix algebra admitting a basis $\mathsf{B}$ with nonnegative structure constants in which the matrix of the multiplication by $A$ coincides with…
Associating graph algebras to directed graphs leads to both covariant and contravariant functors from suitable categories of graphs to the category k-Alg of algebras and algebra homomorphisms. As both functors are often used at the same…
We geometrically describe the relation induced on a set of graphs by isomorphism of their associated graph C*-algebras as the smallest equivalence relation generated by five types of moves. The graphs studied have finitely many vertices and…
It is known that given a directed graph E and a subset X of vertices, the sum of the projections associated to the vertices in X in the C*-algebra of E converges strictly in the multiplier algebra to a projection P. Here we give a…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
This is the first of series of talks presented at a permanent Rutgers workshop on noncommutative algebra and geometry. We study here quadratic and quadratic-linear algebras defined by factorizations of noncommutative polynomials and…
By natural way the hierarchy structure is introduced on directed graphs with weighted adjacencies. Embedded system of algebras of subsets of the set of vertices of such digraph and it's consolidations, which vertices are the elementary sets…
We define and investigate properties of universal operator algebras of directed graphs. Results include free products decomposition and continuity of the construction with respect to direct limits. Lastly we prove some K-theoretic results…
Evolution algebras are non-associative algebras inspired from biological phenomena, with applications to or connections with different mathematical fields. There are two natural ways to define an evolution algebra associated to a given…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…
Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…