The structure of a graph inverse semigroup
Given any directed graph E one can construct a graph inverse semigroupG(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 non-Rees congruences on G(E), show that the quotient of G(E) by any Rees congruence is another graph inverse semigroup, and classify the G(E) that have only Rees congruences. We also find the minimum possible degree of a faithful representation by partial transformations of any countable G(E), and we show that a homomorphism of directed graphs can be extended to a homomorphism (that preserves zero) of the corresponding graph inverse semigroups if and only if it is injective.
KeywordsInverse semigroup Directed graph Congruence
- 4.Costa, A., Steinberg, B.: A categorical invariant of flow equivalence of shifts. Ergod. Theory Dyn. Syst. 36, 470–513 (2016)Google Scholar
- 8.Jones, D.G.: Polycyclic monoids and their generalisations. Ph. D. Thesis, Heriot-Watt University (2011)Google Scholar
- 14.Mesyan, Z., Mitchell, J.D., Morayne, M., Péresse, Y.: Topological graph inverse semigroups. arXiv:1306.5388
- 15.Mitchell, J.D., et al.: Semigroups - GAP package, Version 2.4. (April 2015). http://www-groups.mcs.st-andrews.ac.uk/~jamesm/semigroups.php