Counting monogenic monoids and inverse monoids
classification
🧮 math.GR
math.RA
keywords
monogenicmonoidsinversefinitefullnumbersubmonoidssubsemigroups
read the original abstract
In this short note, we show that the number of monogenic submonoids of the full transformation monoid of degree $n$ for $n > 0$, equals the sum of the number of cyclic subgroups of the symmetric groups on $1$ to $n$ points. We also prove an analogous statement for monogenic subsemigroups of the finite full transformation monoids, as well as monogenic inverse submonoids and subsemigroups of the finite symmetric inverse monoids.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.