English

Topological Graph Inverse Semigroups

Group Theory 2016-05-26 v2 Rings and Algebras

Abstract

To every directed graph EE one can associate a \emph{graph inverse semigroup} G(E)G(E), where elements roughly correspond to possible paths in EE. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path algebras, Cohn path algebras, Cuntz-Krieger CC^*-algebras, and Toeplitz CC^*-algebras. We investigate topologies that turn G(E)G(E) into a topological semigroup. For instance, we show that in any such topology that is Hausdorff, G(E){0}G(E)\setminus \{0\} must be discrete for any directed graph EE. On the other hand, G(E)G(E) need not be discrete in a Hausdorff semigroup topology, and for certain graphs EE, G(E)G(E) admits a T1T_1 semigroup topology in which G(E){0}G(E)\setminus \{0\} is not discrete. We also describe, in various situations, the algebraic structure and possible cardinality of the closure of G(E)G(E) in larger topological semigroups.

Keywords

Cite

@article{arxiv.1306.5388,
  title  = {Topological Graph Inverse Semigroups},
  author = {Z. Mesyan and J. D. Mitchell and M. Morayne and Y. H. Péresse},
  journal= {arXiv preprint arXiv:1306.5388},
  year   = {2016}
}

Comments

25 pages. The second version contains additional references and improved exposition

R2 v1 2026-06-22T00:38:43.091Z