Related papers: Comparability in the graph monoid

If $E$ is a not-necessarily row-finite graph, such that each vertex of $E$ emits at most countably many edges, then a {\it desingularization} $F$ of $E$ can be constructed (see e.g. (1) G. Abrams, G. Aranda Pino, Leavitt path algebras of…

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

We introduce the {\it growth partition function} $Z_{\Gamma,G}(t)$ associate with any cancellative infinite monoid $\Gamma$ with a finite generator system $G$. It is a power series in $t$ whose coefficients lie in integral Lie-like space…

Let \( G \) be a finite non-cyclic group. Define \( \mathrm{Cyc}(G) \) as the set of all elements \( a \in G \) such that for any $b\in G$, the subgroup \( \langle a, b \rangle \) is cyclic. The \emph{non-cyclic graph} $\Gamma(G)$ of \( G…

Let E be an arbitrary graph and K be any field. For every non-graded ideal I of the Leavitt path algebra L_{K}(E), we give an explicit description of the generators of I. Using this, we show that every finitely generated ideal of L_{K}(E)…

Graph products of monoids provide a common framework for direct and free products, and graph monoids (also known as free partially commutative monoids). If the monoids in question are groups, then any graph product is, of course, a group.…

Fix a commutative monoid $(T,+,0)$, a commutative monoid $(\Gamma,+,0_\Gamma)$, and a map \[ (a,\alpha,b,\beta,c)\longmapsto a\,\alpha\,b\,\beta\,c\in T \] which is additive in each variable and associative in the ternary sense. A left…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

A half a century ago, George Bergman introduced stunning machinery which would realise any commutative conical monoid as the non-stable $K$-theory of a ring. The ring constructed is ``minimal" or ``universal". Given the success of graded…

This paper lays out the foundations of graded $K$-theory for Leavitt algebras associated with higher-rank graphs, also known as Kumjian-Pask algebras, establishing it as a potential tool for their classification. For a row-finite $k$-graph…

We show that every subset of vertices of a directed graph E gives a Morita equivalence between a subalgebra and an ideal of the associated Leavitt path algebra. We use this observation to prove an algebraic version of a theorem of Crisp and…

Associated with each finite subgroup $\Gamma$ of $\rm{SL}_2(\mathbb{C})$ there is a family of noncommutative algebras $O_\tau(\Gamma)$ quantizing $\mathbb{C}^2/\!\!/\Gamma$. Let $G_\Gamma$ be the group of $\Gamma$-equivariant automorphisms…

Let $R$ be a commutative ring with unity. The co-maximal ideal graph of $R$, denoted by $\Gamma(R)$, is a graph whose vertices are the proper ideals of $R$ which are not contained in the Jacobson radical of $R$, and two vertices $I_1$ and…

Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…

For a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that opposite orientations of the same edge are assigned inverse elements. A path in $G$ is…

We define the action of a locally compact group $G$ on a topological graph $E$. This action induces a natural action of $G$ on the $C^*$-correspondence ${\mathcal H}(E)$ and on the graph $C^*$-algebra $C^*(E)$. If the action is free and…

Given an arbitrary graph $E$ we investigate the relationship between $E$ and the groupoid $G_E$. We show that there is a lattice isomorphism between the lattice of pairs $(H, S)$, where $H$ is a hereditary and saturated set of vertices and…

Let $R$ be a commutative ring with $\Z(R)$ its set of zero-divisors. In this paper, we study the total graph of $R$, denoted by $\T(\Gamma(R))$. It is the (undirected) graph with all elements of $R$ as vertices, and for distinct $x, y\in…

For any graph $G=(V,E)$, a subset $S\subseteq V$ \emph{dominates} $G$ if all vertices are contained in the closed neighborhood of $S$, that is $N[S]=V$. The minimum cardinality over all such $S$ is called the domination number, written…

We characterise directed graphs consisting of disjoint cycles via their talented monoids. We show that a graph $E$ consists of disjoint cycles precisely when its talented monoid $T_E$ has a certain Jordan-H\"older composition series. These…