GAP: Generating Set in Semigroups of Order-Preserving full Contraction
Loading...
Date
2016-05-01
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Duncan Science Company Publication
Abstract
I or ]' - ( 'i BSTRACT
.L,, r 1,2.' ".tt : . --l (pttt'tittl) trtutr.f ;)nnitti()tt
a: Dotlt ct c -Y,, -+ ln a c.\',, rr sui,l ltt be ftrll or tt,t,tl y Or,r, a - .\.,,.
othent'ise is called strictly pctrriar. A tnap ct e sing,, is saicr to be orcre rpreserving
if, for all .t-,),€,.1',.-r< 1t:=y61 11ts or4 tio ntop GL:Sing,, is suic{
tobeacontractionf foratl .y.J/eX,,, lrc<),al<1.-;_),j. Itrthisp,pct.,r,e
extend the resu!ts of 13J an cer.tcrin seruigroups o.[JiniteJittt c.otttt.action maps b1,
computing rhe generating set properties of the sentigroup ocr,. of alt ot.cler.-
presen'ing fLtll contraction mcips on the finite rrel {i. 2,...,r} Ihrough rhe use of
Group Algoritlu, Prograntne (GAp)
Description
Keywords
Citation
https:duncanjournal