Related papers: Leavitt path algebras having Graded Invariant Basi…
Leibniz algebras are certain generalizations of Lie algebras. Motivated by the concept of subinvariance in group theory, Schenkman studied properties of subinvariant subalgebras of a Lie algebra. In this paper we define subinvariant…
Adapting a recent work of Brannan et al., on extending graph $C^*$-algebras to Quantum graphs, we introduce "Quantum Quivers" as an analogue of quivers where the edge and vertex set has been replaced by a $C^*$-algebra and the maps between…
We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…
For integer $n$, the $n$-iterated line graph $L^n(G)$ of an undirected graph $G$ is defined to be $L(L^{n-1}(G))$, where $L^1(G)$ is the line graph $L(G)$ of $G$. In this paper we introduce hamiltonian path index. Hamiltonian path index,…
In this article, we provide an explicit description of a set of generators for any ideal of an ultragraph Leavitt path algebra. We provide several additional consequences of this description, including information about generating sets for…
Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…
We prove that if E and F are graphs with a finite number of vertices and an infinite number of edges, if K is a field, and if L_K(E) and L_K(F) are simple Leavitt path algebras, then L_K(E) is Morita equivalent to L_K(F) if and only if…
Inferring properties of graph-structured data, e.g., the solubility of molecules, essentially involves learning the implicit mapping from graphs to their properties. This learning process is often costly for graph property learners like…
In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…
Graph processes exhibit a temporal structure determined by the sequence index and and a spatial structure determined by the graph support. To learn from graph processes, an information processing architecture must then be able to exploit…
One of the key problems of GNNs is how to describe the importance of neighbor nodes in the aggregation process for learning node representations. A class of GNNs solves this problem by learning implicit weights to represent the importance…
We show that any pointed, preordered module map $\mathfrak{BF}_{\mathrm{gr}}(E) \to \mathfrak{BF}_{\mathrm{gr}}(F)$ between Bowen-Franks modules of finite graphs can be lifted to a unital, graded, diagonal preserving $\ast$-homomorphism…
We provide a complete answer to the question "When is a quotient of a Leavitt path algebra isomorphic to a Leavitt path algebra?" in terms of the interaction of the kernel of the quotient homomorphism with the cycles of the digraph. A key…
In this paper we completely describe graphically Leavitt path algebras with bounded index of nilpotence and show that each graded simple module $S$ over a Leavitt path algebra with bounded index of nilpotence is graded $\Sigma$-injective,…
We study some homological invariants of a given generalized bound path algebra in terms of those of the algebras used in its construction. We discuss the particular case where the algebra is a generalized path algebra and give conditions…
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…
The classical theorem of Weitzenboeck states that the algebra of invariants of a single unipotent transformation $g$ in $GL_m(K)$ acting on the polynomial algebra $K[x_1,...,x_m]$ over a field $K$ of characteristic 0 is finitely generated.…
We introduce a geometric completion of the stack of maps from stable marked curves to the quotient stack [point/GL(1)], and use it to construct some gauge-theoretic analogues of the Gromov-Witten invariants. We also indicate the…
A group graded $K$-algebra $A=\bigoplus\limits_{g\in G} A_g$ is called "locally finite" if $\dim_K A_g < \infty$ for every $g\in G$. We characterise the weighted graphs $(E,w)$ for which the weighted Leavitt path algebra $L_K(E,w)$ is…
Graph Neural Networks (GNNs) are widely used deep learning models that learn meaningful representations from graph-structured data. Due to the finite nature of the underlying recurrent structure, current GNN methods may struggle to capture…