Related papers: Graph products of right cancellative monoids
In this paper we discuss graph inverse semigroups which are constucted from a directed graphs and study several interesting properties of graph inverse semigroups such as the nature of its idempotents, the structure of semilattice of…
Graph monoids arise naturally in the study of non-stable K-theory of graph C*-algebras and Leavitt path algebras. They play also an important role in the current approaches to the realization problem for von Neumann regular rings. In this…
This article is dedicated to the study of the acylindrical hyperbolicity of automorphism groups of graph products of groups. Our main result is that, if $\Gamma$ is a finite graph which contains at least two vertices and is not a join and…
This work concerns results on conditions guaranteeing that certain banded $M$-matrices have banded inverses. As a first goal, a graph theoretic characterization for an off-diagonal entry of the inverse of an $M$-matrix to be positive, is…
We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…
An inverse monoid $S$ is called $F$-inverse if each $\sigma$-class of $S$, where $\sigma$ is the minimum group congruence of $S$, has a maximum element with respect to the natural order of $S$. Since the property of an inverse monoid being…
Braid groups and mapping class groups have many features in common. Similarly to the notion of inverse braid monoid inverse mapping class monoid is defined. It concerns surfaces with punctures, but among given $n$ punctures several can be…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act itself has a finite presentation; it is weakly right coherent if every finitely generated right ideal of $S$ has a finite…
A graph is \emph{well-dominated} if all of its minimal dominating sets have the same cardinality. We prove that at least one of the factors is well-dominated if the Cartesian product of two graphs is well-dominated. In addition, we show…
Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial…
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…
A semigroup S containing a zero element is said to be 0-left cancellative if st = sr \neq 0 implies that t = r. Given such an S we build an inverse semigroup H(S), called the inverse hull of S. Motivated by the study of certain C*-algebras…
A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…
We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated…
It is known that an inverse monoid $M$ is E-unitary if and only if the following diagram is an extension: $E(M) \to M \to M/\sigma$, where $E(M)$ is the semilattice of idempotents and $M/\sigma$ is the minimal group quotient. F-inverse…
We show that the category of $X$-generated $E$-unitary inverse monoids with greatest group image $G$ is equivalent to the category of $G$-invariant, finitary closure operators on the set of connected subgraphs of the Cayley graph of $G$.…
We compute the monoid $V(L_K(E))$ of isomorphism classes of finitely generated projective modules over certain graph algebras $L_K(E)$, and we show that this monoid satisfies the refinement property and separative cancellation. We also show…
The aim of this paper is sketch a theory of divisibility and factorisation in topological monoids, where finite products are replaced by convergent products. The algebraic case can then be viewed as the special case of discretely…
The principal left ideal graph of a semigroup is a simple graph whose vertices are the non-zero elements of the semigroup, and two vertices are adjacent if their principal left ideals intersect non-trivially. In this paper, we study the…