Labelled graphs as Morita equivalence invariants for a class of inverse semigroups
classification
🧮 math.GR
keywords
inverselabelledmoritaclassequivalencegraphgraphsmarkov
read the original abstract
We investigate the use of labelled graphs as a Morita equivalence invariant for inverse semigroups. We construct a labelled graph from a combinatorial inverse semigroup $S$ with $0$ admitting a special set of idempotent $\mathcal{D}$-class representatives and show that $S$ is Morita equivalent to a labelled graph inverse semigroup. For the inverse hull $S$ of a Markov shift, we show that the labelled graph determines the Morita equivalence class of $S$ among all other inverse hulls of Markov shifts.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.