Minimal generating set of the semigroup of partitioned binary relations (Q7028362)

The paper aims at the problem of determining the size of a minimal generating set of a semigroup. The author here focuses on the comparison between the rank of the full transformation semigroup and the partition monoid of degree $n$ and that of the semigroup of binary relations. The first one does not depend on $n$ whereas the latter one increases exponentially with $n$. In this paper, the author proves that the rank of the semigroup of partitioned binary relations also increases exponentially with $n$. The results proved here are insightful and the methodologies employed are explained with suitable diagrams. The paper may be much more better with the insertion of examples and counter examples in appropriate places. A resourceful reference list is given at the end of the paper.