Files in this item
Topological graph inverse semigroups
Item metadata
dc.contributor.author | Mesyan, Z. | |
dc.contributor.author | Mitchell, J. D. | |
dc.contributor.author | Morayne, M. | |
dc.contributor.author | Péresse, Y. H. | |
dc.date.accessioned | 2017-05-24T23:33:42Z | |
dc.date.available | 2017-05-24T23:33:42Z | |
dc.date.issued | 2016-08-01 | |
dc.identifier | 242972024 | |
dc.identifier | d80f1069-d9bd-44cc-aa06-3d0a71f48116 | |
dc.identifier | 84969895385 | |
dc.identifier | 000378969700009 | |
dc.identifier.citation | Mesyan , Z , Mitchell , J D , Morayne , M & Péresse , Y H 2016 , ' Topological graph inverse semigroups ' , Topology and Its Applications , vol. 208 , pp. 106-126 . https://doi.org/10.1016/j.topol.2016.05.012 | en |
dc.identifier.issn | 0166-8641 | |
dc.identifier.other | Bibtex: urn:5c79c16c8c45b6fed138eed704eedcfe | |
dc.identifier.other | ORCID: /0000-0002-5489-1617/work/73700801 | |
dc.identifier.uri | https://hdl.handle.net/10023/10847 | |
dc.description | Michał Morayne was partially supported by NCN grant DEC-2011/01/B/ST1/01439 while this work was performed. | en |
dc.description.abstract | 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⁎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 T1 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. | |
dc.format.extent | 21 | |
dc.format.extent | 247663 | |
dc.language.iso | eng | |
dc.relation.ispartof | Topology and Its Applications | en |
dc.subject | Graph inverse semigroup | en |
dc.subject | Polycyclic monoid | en |
dc.subject | Topological semigroup | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Topological graph inverse semigroups | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1016/j.topol.2016.05.012 | |
dc.description.status | Peer reviewed | en |
dc.date.embargoedUntil | 2017-05-24 | |
dc.identifier.url | http://arxiv.org/abs/1306.5388 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.