2018/06/28 by Zhengpan Wang, Wang, Zheng-Pan
Computer Science · Mathematics · #Advanced Operator Algebra Research #Advanced Topics in Algebra #FOS: Mathematics #Group Theory (math.GR) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1806.10721
openalex publication_date 2018/06/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Inverse graph semigroups were defined by Ash and Hall in 1975. They found necessary and sufficient conditions for the semigroups to be congruence free. In this paper we give a description of congruences on a graph inverse semigroup in terms of the underlying graph. As a consequence, we show that the inverse graph semigroup of a finite graph is congruence Noetherian.