Answering five open problems involving semigroup conjugacy (Q7230376)

The author describes the semigroup coujugacy as an equivalence relation that equals group conjugacy when the semi group is a group. Partial solutions of five open problems involving semi group conjugacy are the main focus of the paper. As a consequence, it is viewed here that conjugacy in groups is certainly not partition-covering. Also for finite groups, the Orbit-Stabilizer theorem ensures that the size of each conjugacy class must divide the size of the group. In the paper the author has further studied that conjugacies could be partially ordered by inclusion. Also the partial answers for an infinite set of first order definable conjugacies that forms either a chain ordered by inclusion or an anti-chain ordered by inclusion are given. The paper contains an updated and resourceful reference list at the end.