Each graph inverse semigroup embeds into a $\lambda$-polycyclic monoid
Serhii Bardyla · arXiv (Cornell University) · 2017
In this paper we prove that a graph inverse semigroup $G(E)$ over a directed graph $E$ embeds into the $\lambda$-polycyclic monoid $\mathcal{P}_{\lambda}$ where $\lambda=|G(E)|$. Moreover, each countable graph inverse semigroup embeds into the polycyclic monoid $\mathcal{P}_{2}$.