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.

生成讲解博客的中文版本

生成AI智能校验的中文版本