On locally compact semitopological graph inverse semigroups
arXiv:1801.01998
Abstract
In this paper we investigate locally compact semitopological graph inverse semigroups. Our main result is the following: if a directed graph is strongly connected and contains a finite amount of vertices then a locally compact semitopological graph inverse semigroup is either compact or discrete. This result generalizes results of Gutik and Bardyla who proved the above dichotomy for locally compact semitopological polycyclic monoids and , respectively.
arXiv admin note: text overlap with arXiv:1706.08594