...
首页> 外文期刊>Topology and its applications >Topological graph inverse semigroups
【24h】

Topological graph inverse semigroups

机译:拓扑图逆半群

获取原文
获取原文并翻译 | 示例

摘要

To every directed graph E one can associate a graph inverse semigroup G(E), where elements roughly correspond to possible paths in E. These semigroups generalize polycyclic monoids, and they arise in the study of Leavitt path algebras, Cohn path algebras, graph C*-algebras, and Toeplitz C*-algebras. We investigate topologies that turn G(E) into a topological semigroup. For instance, we show that in any such topology that is Hausdorff, G(E) {0} must be discrete for any directed graph E. On the other hand, G(E) need not be discrete in a Hausdorff semigroup topology, and for certain graphs E, G(E) admits a T-1 semigroup topology in which G(E) {0} is not discrete. We also describe, in various situations, the algebraic structure and possible cardinality of the closure of G(E) in larger topological semigroups. (C) 2016 Elsevier B.V. All rights reserved.
机译:对于每个有向图E,可以将一个图逆半群G(E)关联起来,其中元素大致对应于E中的可能路径。这些半群概括了多环类曲面,它们出现在Leavitt路径代数,Cohn路径代数,图C的研究中*-代数和Toeplitz C *-代数。我们研究了将G(E)变成拓扑半群的拓扑。例如,我们表明,在任何这样的拓扑中,即Hausdorff中,对于任何有向图E,G(E){0}必须是离散的。另一方面,在Hausdorff半群拓扑中G(E)不必是离散的,并且对于某些图E,G(E)接受T-1半群拓扑,其中G(E){0}不是离散的。我们还描述了在各种情况下较大拓扑半群中G(E)闭包的代数结构和可能的基数。 (C)2016 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号