Topological Graph Inverse Semigroups
arXiv:1306.5388 · doi:10.1016/j.topol.2016.05.012
Abstract
To every directed graph one can associate a \emph{graph inverse semigroup} , where elements roughly correspond to possible paths in . These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path algebras, Cohn path algebras, Cuntz-Krieger -algebras, and Toeplitz -algebras. We investigate topologies that turn into a topological semigroup. For instance, we show that in any such topology that is Hausdorff, must be discrete for any directed graph . On the other hand, need not be discrete in a Hausdorff semigroup topology, and for certain graphs , admits a semigroup topology in which is not discrete. We also describe, in various situations, the algebraic structure and possible cardinality of the closure of in larger topological semigroups.
25 pages. The second version contains additional references and improved exposition
References in corpus (3)
Cited by in corpus (13)
- On a complete topological inverse polycyclic monoid
- Classifying locally compact semitopological polycyclic monoids
- Topological properties of Taimanov semigroups
- On inverse submonoids of the monoid of almost monotone injective co-finite partial selfmaps of positive integers
- On locally compact semitopological -bisimple inverse -semigroups
- On the semigroup which is generated by the family of finite bounded intervals of
- On lattice of congruences on graph inverse semigroups
- On a semitopological polycyclic monoid
- E-disjunctive inverse semigroups
- On locally compact shift-continuous topologies on the -bicyclic monoid
- Closed inverse subsemigroups of graph inverse semigroups
- The monoid of order isomorphisms of principal filters of a power of the positive integers
- Congruences on graph inverse semigroups