On the cyclic inverse monoid on a finite set
Abstract
In this paper we study the cyclic inverse monoid n on a set n with n elements, i.e. the inverse submonoid of the symmetric inverse monoid on n consisting of all restrictions of the elements of a cyclic subgroup of order n acting cyclically on n. We show that n has rank 2 (for n≥slant2) and n2n-n+1 elements. Moreover, we give presentations of n on n+1 generators and 12(n2+3n+4) relations and on 2 generators and 12(n2-n+6) relations. We also consider the remarkable inverse submonoid n of n constituted by all its order-preserving transformations. We show that n has rank n and 3· 2n-2n-1 elements. Furthermore, we exhibit presentations of n on n+2 generators and 12(n2+3n+8) relations and on n generators and 12(n2+3n) relations.
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.