<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">
Nasarawa State University, KeffiNasarawa State University, KeffiInstitutional Repository

On Number of Idempotent Elements in Finite Semigroup of Full Order -Preserving Contractions

dc.contributor.authorAmadu, Kabiru
dc.contributor.authorUmar, Mallam Abdulkarim
dc.contributor.authorHabibu, Shamsuddeen
dc.contributor.authorBello, Asma'u
dc.date.accessioned2023-04-14T10:32:24Z
dc.date.available2023-04-14T10:32:24Z
dc.date.issued2021-10-28
dc.description.abstractIn this paper, we considered the semigroupOCTn consisting of all mappings of a-finite set Xn - (1, 2, 3, - - - , n} which are both order — preserving and contraction, that is mappinga : Xn -» Xn ^ ich that, for all ,y e Xn, x => x a £ y a,anc | x a — *y a <1 x—y| . In particular, we proposed a closed form formula for the number of idempotent elements in OCTn, (that is elements oc satisfying oc2=oc).en_US
dc.identifier.citationUmar, M.A. et al. (2021) On Number of Idempotent Elements in Finite Semigroup of Full Order -Preserving Contractionsen_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/6914
dc.language.isoenen_US
dc.publisherDepartment of Mathematics, Nasarawa State University Keffien_US
dc.subjectFull Transformation, Contraction, Idempotenten_US
dc.titleOn Number of Idempotent Elements in Finite Semigroup of Full Order -Preserving Contractionsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
6. (OCT. 2021).pdf
Size:
1.29 MB
Format:
Adobe Portable Document Format
Description:
Article

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:

Collections