On universal objects in the class of graph inverse semigroups
Serhii Bardyla

TL;DR
This paper demonstrates that polycyclic monoids serve as universal objects for graph inverse semigroups, showing embeddings and topological properties that unify these algebraic structures.
Contribution
It establishes that all graph inverse semigroups can embed into polycyclic monoids and introduces a natural coarsest inverse semigroup topology for these structures.
Findings
Graph inverse semigroups embed into polycyclic monoids.
A coarsest inverse semigroup topology exists for each graph inverse semigroup.
Injective homomorphisms are topological embeddings.
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 over a directed graph embeds into the polycyclic monoid where . We show that each graph inverse semigroup admits the coarsest inverse semigroup topology . Moreover, each injective homomorphism from to the is a topological embedding.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
