Related papers: Congruences on graph inverse semigroups
Congruences on a graph inverse semigroup were recently described in terms of the underline graph. Based on such descriptions, we show that the lattice of congruences on a graph inverse semigroup is upper semimodular but not lower…
Given any directed graph E one can construct a graph inverse semigroup G(E), where, roughly speaking, elements correspond to paths in the graph. In this paper we study the semigroup-theoretic structure of G(E). Specifically, we describe the…
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…
As part of his study of representations of the polycylic monoids, M.V. Lawson described all the closed inverse submonoids of a polycyclic monoid $P_n$ and classified them up to conjugacy. We show that Lawson's description can be extended to…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We build on the description of left congruences on an inverse semigroup in terms of the kernel and trace due to Petrich and Rankin. The notion of an inverse kernel for a left congruence is developed. Various properties of both the trace and…
In this paper we investigate graph inverse semigroups which are subsemigroups of compact-like topological semigroups. More precisely, we characterise graph inverse semigroups which admit a compact semigroup topology and describe graph…
From any directed graph $E$ one can construct the graph inverse semigroup $G(E)$, whose elements, roughly speaking, correspond to paths in $E$. Wang and Luo showed that the congruence lattice $L(G(E))$ of $G(E)$ is upper-semimodular for…
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…
Let $S$ be an inverse semigroup with zero and let $Z(S)^\times$ be its set of non-zero divisors with respect to the natural partial order $\le $ on $S$, that is, $a \in Z(S)^\times $ if there exists $b\in S\setminus\{0\}$ with $\omega(a, b)…
Let {\Gamma} be a directed graph and Inv({\Gamma}) be the graph inverse semigroup of {\Gamma}. Luo and Wang [7] showed that the congruence lattice C(Inv({\Gamma})) of any graph inverse semigroup Inv({\Gamma}) is upper semimodular, but not…
An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…
We call a semigroup $S$ f-noetherian if every right congruence of finite index on $S$ is finitely generated. We prove that every finitely generated semigroup is f-noetherian, and investigate whether the properties of being f-noetherian and…
A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the…
In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We recall the new notion of the so-called negatively invertible graphs investigated by the authors in the recent…
Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…
The index of a subgroup of a group counts the number of cosets of that subgroup. A subgroup of finite index often shares structural properties with the group, and the existence of a subgroup of finite index with some particular property can…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
An inverse semigroup $S$ is a semigroup in which every element has a unique inverse in the sense of semigroup theory, that is, if $a \in S$ then there exists a unique $b\in S$ such that $a = aba$ and $b = bab$. We say that an inverse…