Algorithm for semigroup bases I

Avtorji

  • M. I. Sampson Department of Mathematics, Akwa Ibom State University, Ikot Akpaden, Nigeria
  • Z. Lipcsey Department of Mathematics, University of Calabar, Nigeria.
  • E.O. Akak Department of Mathematics, Akwa Ibom State University, Ikot Akpaden, Nigeria
  • F.A. Efiong Department of Mathematics, University of Uyo, Uyo, Nigeria.
  • M.A. Essien Department of Mathematics, Akwa Ibom State University

Ključne besede:

Basis, Independent, generating set, Minimal, maximal, Vector spaces

Povzetek

The study of generating sets and bases in semigroup theory started with the experience in the topics in vector spaces, and so with comparison, theorems on independent generating sets of Semigroup that vary from those about independent generating sets in vector spaces due to some differences in their structures are given. The paper shows that there may exist a maximal independent set of elements in a semigroup which does not form a generating set. It reveals that there may exists independent set in a semigroup which cannot be expanded to a generating set, and that adding an element independent from an independent set may make the independent set dependent in a semigroup. Also, given is an important condition fulfilled by a Basis in a semigroup. The paper gives an interesting property that serves as a relevant test tool for independent generating sets in the developed algorithms for determining the basis of any given semigroup. The resulting algorithm works for determining the basis any semigroup including classes of semigroups.

Objavljeno

2024-07-10

Kako citirati

Sampson, M. I., Lipcsey, Z. ., Akak, E. ., Efiong, F. ., & Essien, M. . (2024). Algorithm for semigroup bases I. International Journal of Mathematical Analysis and Modelling, 7(1). Pridobljeno od https://tnsmb.org/journal/index.php/ijmam/article/view/142