A Study on the Relationship Between Minimal Generating Sets and Independence in Semigroups

This paperreviews the work ofM.I. Sampson et. Al (2023) [7], and delves into the intricate relationship between minimal generating sets and independence in semigroups by examining the comparability of elements induced by orderings on the semigroup. It demonstrates that the existence of a minimal generating set implies independence, and conversely, independence implies the existence of a minimal generating set. Additionally, the paper presents two new algorithms: one for determining minimal generating sets for countable systems of semigroups and another for any given semigroup. These algorithms offer practical solutions for semigroup theorists and researchers. Through rigorous mathematical analysis and proof, this paper sheds light on the fundamental properties of semigroups and their generating sets

Authors

Institutions

Publication Details

Journal
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND MATHEMATICAL THEORY E-ISSN
Published
2026-11-13
DOI
https://doi.org/10.56201/ijcsmt.v10.no1.2024.pg37.47
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Study on the Relationship Between Minimal Generating Sets and Independence in Semigroups

Sampson Marshal Imeh
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND MATHEMATICAL THEORY E-ISSN
semigroups and automata theory
article

A Study on the Relationship Between Minimal Generating Sets and Independence in Semigroups

Sampson Marshal Imeh
article en

Abstract

This paperreviews the work ofM.I. Sampson et. Al (2023) [7], and delves into the intricate relationship between minimal generating sets and independence in semigroups by examining the comparability of elements induced by orderings on the semigroup. It demonstrates that the existence of a minimal generating set implies independence, and conversely, independence implies the existence of a minimal generating set. Additionally, the paper presents two new algorithms: one for determining minimal generating sets for countable systems of semigroups and another for any given semigroup. These algorithms offer practical solutions for semigroup theorists and researchers. Through rigorous mathematical analysis and proof, this paper sheds light on the fundamental properties of semigroups and their generating sets

INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND MATHEMATICAL THEORY E-ISSN
Akwa Ibom State University (NG)
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon