Answering five open problems involving semigroup conjugacy
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.
- A new definition of conjugacy for semigroups
- Conjugacy in inverse semigroups
- Conjugacy in monoids with a special Church-Rosser presentation is decidable
- Conjugation in semigroups.
- Four notions of conjugacy for abstract semigroups
- scientific article; zbMATH DE number 5150185 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3185988 (Why is no real title available?)
- Linear conjugacy
- On the complexity of inverse semigroup conjugacy
- On three approaches to conjugacy in semigroups.
- Representation theory of finite semigroups over semirings.
- The word problem for one-relation monoids: a survey
This page was built for publication: Answering five open problems involving semigroup conjugacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230376)
