Congruences on Inverse Semigroups using Kernel Normal System

Volume 1, Issue 1, Article 2 - 2016

Authors: Laila M.Tunsi

Copyright © 2016 . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 Download PDF File

 Share on GOOGLE+  Share on Twitter  Share on LinkedIn Open XML File


Congruences on inverse semigroups via the (kernel-trace) method introduced by Scheiblich in 1974. In this paper we discuss the congruences on inverse semigroups by using the technique of Kernel normal systems. Congrueneses on inverse semigroup were described in terms of congruences pairs (ker tr ). It is natural to ask if this strategy can be extended to include regular semigroups. Feigenbaum in 1979 has achieved this. However, this approach has not proved to be the best possible for congruences on regular semigroups in general. Whilst it is possible to describe abstractly the trace and kernel of congruence on a regular semigroup, these descriptions are unwieldy. The technique which has proved most useful for studying congruences on arbitrary regular semigroups is that due to Preston of Kernel normal systems.

How To Cite This Article

@article{Tunsi_2016, doi = {10.31559/glm2016.1.1.2}, url = {}, year = 2016, month = {aug}, publisher = {Refaad for Studies and Research}, volume = {1}, number = {1}, author = {Laila Tunsi}, title = {Congruences on Inverse Semigroups using Kernel Normal System}, journal = {General Letters in Mathematics} }
Tunsi, L. (2016). Congruences on Inverse Semigroups using Kernel Normal System. General Letters in Mathematics, 1(1). doi:10.31559/glm2016.1.1.2
[1]L. Tunsi, “Congruences on Inverse Semigroups using Kernel Normal System,” General Letters in Mathematics, vol. 1, no. 1, Aug. 2016.
Chicago Tunsi, Laila. “Congruences on Inverse Semigroups Using Kernel Normal System.” General Letters in Mathematics 1, no. 1 (August 1, 2016). doi:10.31559/glm2016.1.1.2.