On universal objects in the class of graph inverse semigroups
Abstract
In this paper we show that polycyclic monoids are universal objects in the class of graph inverse semigroups. In particular, we prove that a graph inverse semigroup G(E) over a directed graph E embeds into the polycyclic monoid Pλ where λ=|G(E)|. We show that each graph inverse semigroup G(E) admits the coarsest inverse semigroup topology τ. Moreover, each injective homomorphism from (G(E),τ) to the (P|G(E)|,τ) is a topological embedding.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.