Related papers: Leavitt path algebras having Graded Invariant Basi…

We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…

We study degree bounds on rational but not necessarily polynomial generators for the field $\mathbf{k}(V)^G$ of rational invariants of a linear action of a finite abelian group. We show that lattice-theoretic methods used recently by the…

Let $E$ be a directed graph, $\mathbb K$ be a field, and $\mathbb F$ be the free group on the edges of $E$. In this work, we use the isomorphism between Leavitt path algebras and partial skew group rings to endow $L_{\mathbb K}(E)$ with an…

Graph Neural Networks (GNNs) have received increasing attention due to their ability to learn from graph-structured data. To open the black-box of these deep learning models, post-hoc instance-level explanation methods have been proposed to…

Let $E$ be an arbitrary directed graph and let $L$ be the Leavitt path algebra of the graph $E$ over a field $K$. The necessary and sufficient con- ditions are given to assure the existence of a maximal ideal in $L$ and also the necessary…

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…

Viewing Leavitt path algebras of finite digraphs as rings of quotients defined by the ideal topology of the ideal generated by all arrows and sinks allows us to induce their representations from those of the quiver algebras and therefore…

We study lattices in free abelian groups of infinite rank that are invariant under the action of the infinite symmetric group, with emphasis on finiteness of their equivariant bases. Our framework provides a new method for proving…

In this paper, we study ideal- and congruence-simpleness for the Leavitt path algebras of directed graphs with coefficients in a commutative semiring S, as well as establish some fundamental properties of those algebras. We provide a…

Leavitt path algebras of bi-separated graphs have been recently introduced by R. Mohan and B. Suhas. These algebras provide a common framework for studying various generalisations of Leavitt path algebras. In this paper we obtain modules…

This article surveys results on graded algebras and their Hilbert series. We give simple constructions of finitely generated graded associative algebras $R$ with Hilbert series $H(R,t)$ very close to an arbitrary power series $a(t)$ with…

We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…

This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a…

Graphons are symmetric measurable functions that arise from a sequence of graphs. A graphon variety is the a set of all graphons defined by a condition of the form $t(g, W) = 0$ for a fixed quantum graph $g$, where $t(.,.)$ is the…

Given the input graph and its label/property, several key problems of graph learning, such as finding interpretable subgraphs, graph denoising and graph compression, can be attributed to the fundamental problem of recognizing a subgraph of…

If $K$ is a field with involution and $E$ an arbitrary graph, the involution from $K$ naturally induces an involution of the Leavitt path algebra $L_K(E).$ We show that the involution on $L_K(E)$ is proper if the involution on $K$ is…

Let $n$ be a positive integer. For each $0\leq j \leq n-1$ we let $C_n^j$ denote the Cayley graph of the cyclic group $\mathbb{Z}_n$ with respect to the subset $\{1,j\}$. Utilizing the Smith Normal Form process, we give an explicit…

In this paper we explore whether or not deep neural architectures can learn to classify Boolean satisfiability (SAT). We devote considerable time to discussing the theoretical properties of SAT. Then, we define a graph representation for…

Let $F$ be an infinite field, and let $M_{n}(F)$ be the algebra of $n\times n$ matrices over $F$. Suppose that this algebra is equipped with an elementary grading whose neutral component coincides with the main diagonal. In this paper, we…

Graph neural networks (GNNs) are a powerful tool to learn representations on graphs by iteratively aggregating features from node neighbourhoods. Many variant models have been proposed, but there is limited understanding on both how to…