Labelled graphs as Morita equivalence invariants for a class of inverse semigroups
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 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.