An equivalence in a selected family of cyclic subsemigroups and algorithm for generating systems of semigroup

Authors

  • M.I. Sampson Akwa Ibom State University, Ikot AKpaden
  • C. F. Igiri ‡Department of Mathematics, University of Calabar, Calabar, Nigeria
  • J.O. Achuobi ‡Department of Mathematics, University of Calabar, Calabar, Nigeria
  • C.T. Madubuike †** , Department of Mathematics, Abia State Polytechnic, Aba
  • L.E. Effiong Department of Mathematics, Abia State Polytechnic, Aba

Keywords:

Semigroup, Cyclic, Independent, Minimal, Generating sets

Abstract

This paper focuses on generators of cyclic subsets of semigroups which determines the whole semigroup through algebraic closure. We call a generating set minimal if it does not have a proper generating subset. A set is independent if no element of the set can be generated by the remaining members of the set. Independent subsystems of cyclic semigroups are intersected to obtain the generating set of cyclic semigroups. From intersecting subsystems of cyclic semigroups, a certain equivalence relation on the set of all cyclic Subsemigroups are obtained. The paper also shows how such equivalence relation is a tool for partitioning cyclic subsemigroups into generating subsystems. Algorithm to find the minimal generating set of a semigroups is given.

Downloads

Published

2024-12-08

How to Cite

Sampson, M., Igiri , C. F., Achuobi, J., Madubuike †** , C. ., & Effiong, L. (2024). An equivalence in a selected family of cyclic subsemigroups and algorithm for generating systems of semigroup. International Journal of Mathematical Analysis and Modelling, 7(2). Retrieved from https://tnsmb.org/journal/index.php/ijmam/article/view/175

Issue

Vol. 7 No. 2 (2024): Volume 7, Issue 2, 2024

Section

Articles