Pith. sign in

REVIEW

Topological Graph Inverse Semigroups

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1306.5388 v2 pith:LEK3R5BV submitted 2013-06-23 math.GR math.RA

Topological Graph Inverse Semigroups

classification math.GR math.RA
keywords algebrasgraphsemigroupdiscretesemigroupstopologicaltopologydirected
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path algebras, Cohn path algebras, Cuntz-Krieger $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)\setminus \{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)\setminus \{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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.