On the monoid of partial isometries of a cycle graph
Abstract
In this paper we consider the monoid n of all partial isometries of a n-cycle graph Cn. We show that n is the submonoid of the monoid of all oriented partial permutations on a n-chain whose elements are precisely all restrictions of the dihedral group of order 2n. Our main aim is to exhibit a presentation of n. We also describe Green's relations of n and calculate its cardinal and rank.
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.