Q-guidance: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Helpful Pixie Bot
m ISBNs (Build KE)
 
 
Line 1: Line 1:
If you present photography effectively, it helps you look much more properly at the globe around you. Also, you may want to opt for a more professioanl theme if you are planning on showing your site off to a high volume of potential customers each day. SEO Ultimate - I think this plugin deserves more recognition than it's gotten up till now. They found out all the possible information about bringing up your baby and save money at the same time. The number of options offered here is overwhelming, but once I took the time to begin to review the video training, I was amazed at how easy it was to create a squeeze page and a membership site. <br><br>Always remember that an effective linkwheel strategy strives to answer all the demands of popular  search engines while reacting to the latest marketing number trends. If you have any issues regarding exactly where and how to use [http://www.caliberid.com/surl/wordpressdropboxbackup494594 wordpress backup], you can get in touch with us at our web site. Some of the Wordpress development services offered by us are:. This is the reason for the increased risk of Down Syndrome babies in women over age 35. t need to use the back button or the URL to get to your home page. As soon as you start developing your Word - Press MLM website you'll see how straightforward and simple it is to create an online presence for you and the products and services you offer. <br><br>Photography is an entire activity in itself, and a thorough discovery of it is beyond the opportunity of this content. The only problem with most is that they only offer a monthly plan, you never own the software and you can’t even install the software on your site, you must go to another website to manage your list and edit your autoresponder. I hope this short Plugin Dynamo Review will assist you to differentiate whether Plugin Dynamo is Scam or a Genuine. Enough automated blog posts plus a system keeps you and your clients happy. For any web design and development assignment, this is definitely one of the key concerns, specifically for online retail outlets as well as e-commerce websites. <br><br>If all else fails, please leave a comment on this post with the issue(s) you're having and help will be on the way. In case you need to hire PHP developers or hire Offshore Code - Igniter development services or you are looking for Word - Press development experts then Mindfire Solutions would be the right choice for a Software Development partner. The templates are designed to be stand alone pages that have a different look and feel from the rest of your website. Can you imagine where you would be now if someone in your family bought an original painting from van Gogh during his lifetime. Digital digital cameras now function gray-scale configurations which allow expert photographers to catch images only in black and white. <br><br>Millions of individuals and organizations are now successfully using this tool throughout the world. s ability to use different themes and skins known as Word - Press Templates or Themes. However, there are a few other Wordpress plugins also for its development which requires adding files in your Wordpress setup. Word - Press is an open source content management system which is easy to use and offers many user friendly features. You can check out the statistics of page of views for your web pages using free tools that are available on the internet.
{{Cleanup|reason=various, see talk|date=October 2012}}
In [[mathematics]], a [[semigroup]] is a [[nonempty set]] together with an [[associative]] [[binary operation]]. A '''special class of semigroups''' is a [[Class (set theory)|class]] of [[semigroup]]s satisfying additional [[property (philosophy)|properties]] or conditions. Thus the class of [[commutative]] semigroups consists of all those semigroups in which the binary operation satisfies the commutativity property that ''ab'' = ''ba'' for all elements ''a'' and ''b'' in the semigroup.
The class of [[Finite set|finite]] semigroups consists of those semigroups for which the [[underlying set]] has finite [[cardinality]]. Members of the class of Brandt semigroups are required to satisfy not just one condition but a set of additional properties. A large variety of special classes of semigroups have been defined though not all of them have been studied equally intensively.
 
In the [[algebra]]ic [[theory]] of semigroups, in constructing special classes, attention is focused only on those properties, restrictions and conditions which can be expressed in terms of the binary operations in the semigroups and occasionally on the cardinality and similar properties of [[subset]]s of the [[underlying set]]. The underlying [[set (mathematics)|sets]] are not assumed to carry any other mathematical [[structure]]s like [[Partial order|order]] or [[topology]].
 
As in any algebraic theory,  one of the main problems of the theory of semigroups is the [[classification theorems|classification]] of all semigroups and a complete description of their structure. In the case of semigroups, since the binary operation is required to satisfy only the associativity property the problem of classification is considered extremely difficult. Descriptions of structures have been obtained for certain special classes of semigroups. For example the structure of the sets of idempotents of regular semigroups is completely known. Structure descriptions are presented in terms of better known types of semigroups. The best known type of semigroup is the [[Group (mathematics)|group]].
 
A (necessarily incomplete) list of various special classes of semigroups is presented below. To the extent possible the defining properties are formulated in terms of the binary operations in the semigroups. The references point to the locations from where the defining properties are sourced.
 
== Notations ==
 
In describing the defining properties of the various special classes of semigroups, the following notational conventions are adopted.
 
<center>
{| class="wikitable" border="1"
|+Notations
|-
! Notation
! Meaning
|-
| ''S''
| Arbitrary semigroup
|-
| ''E''
| Set of idempotents in ''S''
|-
|''G''
|Group of units in ''S''
|-
|''X''
| Arbitrary set
|-
| ''a'', ''b'', ''c''
| Arbitrary elements of ''S''
|-
| ''x'', ''y'', ''z''
| Specific elements of ''S''
|-
| ''e'', ''f''. ''g''
| Arbitrary elements of ''E''
|-
| ''h''
| Specific element of ''E''
|-
|''l'', ''m, ''n''
| Arbitrary positive integers
|-
|''j'', ''k''
| Specific positive integers
|-
| 0
| Zero element of ''S''
|-
| 1
| Identity element of ''S''
|-
|''S''<sup>1</sup>
| ''S'' if 1 ∈ ''S''; ''S'' ∪ { 1 } if 1 ∉ ''S''
|-
| ''L'', ''R'', ''H'', ''D'', ''J''
| Green's relations
|-
| ''L''<sub>''a''</sub>, ''R''<sub>''a''</sub>, ''H''<sub>''a''</sub>, ''D''<sub>''a''</sub>, ''J''<sub>''a''</sub>
| Green classes containing ''a''
|-
| ''a'' ≤<sub>''L''</sub> ''b''<br>''a'' ≤<sub>''R''</sub> ''b''<br>''a'' ≤<sub>''H''</sub> ''b''
| ''S''<sup>1</sup>''a'' ⊆ ''S''<sup>1</sup>''b'' <br>''aS''<sup>1</sup> ⊆ ''bS''<sup>1</sup> <br>''S''<sup>1</sup>''a'' ⊆ ''S''<sup>1</sup>''b''  and ''aS''<sup>1</sup> ⊆ ''bS''<sup>1</sup>
|-
|}
</center>
 
== List of special classes of semigroups ==
 
<center>
 
{| class="wikitable sortable" border="1" width="80%"
|+List of special classes of semigroups
|-
! Terminology
! class="unsortable" |Defining property
! Reference(s)
|-
|[[Finite set|Finite]] semigroup
|
*''S'' is a [[finite set]].
|
|-
|[[Empty semigroup]]
|
*''S'' = <math>\emptyset</math>
|
|-
|[[Trivial semigroup]]
|
*Cardinality of ''S'' is 1.
|
|-
|[[Monoid]]
|
*1 ∈ ''S''
|[[#Gril|Gril]] p.&nbsp;3
|-
| [[Band (mathematics)|Band]]<br>(Idempotent semigroup)
|
*''a''<sup>2</sup> = ''a''
|[[#C&P|C&P]]  p.&nbsp;4
|-
| [[Semilattice]]
|
*''a''<sup>2</sup> = ''a''
*''ab '' =  ''ba ''
|[[#C&P|C&P]] p.&nbsp;24
|-
| [[Commutative]] semigroup
|
*''ab'' = '' ba ''
| [[#C&P|C&P]] p.&nbsp;3
|-
|[[Archimedean property|Archimedean]] commutative semigroup
|
*''ab'' = ''ba''
*There exists ''x'' and ''k'' such that ''a'' =  ''xb''<sup>''k''</sup>.
|[[#C&P|C&P]] p.&nbsp;131
|-
|[[Nowhere commutative semigroup]]
|
*''ab'' = ''ba'' &nbsp; ⇒ &nbsp; ''a'' = ''b''
|[[#C&P|C&P]] p.&nbsp;26
|-
|Left weakly commutative
|
*There exist ''x'' and ''k'' such that (''ab'')<sup>''k''</sup> = ''bx''.
|[[#Nagy|Nagy]] p.&nbsp;59
|-
|Right weakly commutative
|
*There exist ''x'' and ''k'' such that (''ab'')<sup>''k''</sup> = ''xb''.
|[[#Nagy|Nagy]] p.&nbsp;59
|-
|Weakly commutative
|
* There exist ''x'' and ''j'' such that (''ab'')<sup>''j''</sup> = ''bx''.
* There exist ''y'' and ''k'' such that (''ab'')<sup>''k''</sup> = ''yb''.
|[[#Nagy|Nagy]] p.&nbsp;59
|-
|Conditionally commutative semigroup
|
*If ''ab'' = ''ba'' then ''axb'' = ''bxa'' for all ''x''.
|[[#Nagy|Nagy]] p.&nbsp;77
|-
|''R''-commutative semigroup
|
*''ab'' ''R'' ''ba''
|[[#Nagy|Nagy]] p.&nbsp;69–71
|-
|''RC''-commutative semigroup
|
*''R''-commutative and conditionally commutative
|[[#Nagy|Nagy]] p.&nbsp;93–107
|-
|''L''-commutative semigroup
|
*''ab'' ''L'' ''ba''
|[[#Nagy|Nagy]] p.&nbsp;69–71
|-
|''LC''-commutative semigroup
|
*''L''-commutative and conditionally commutative
|[[#Nagy|Nagy]] p.&nbsp;93–107
 
|-
|''H''-commutative semigroup
|
*''ab'' ''H'' ''ba''
|[[#Nagy|Nagy]] p.&nbsp;69–71
|-
|Quasi-commutative semigroup
|
*''ab'' = (''ba'')<sup>''k''</sup> for some ''k''.
|[[#Nagy|Nagy]] p.&nbsp;109
|-
|Right commutative semigroup
|
*''xab'' = ''xba''
|[[#Nagy|Nagy]] p.&nbsp;137
|-
|Left commutative semigroup
|
*''abx'' = ''bax''
|[[#Nagy|Nagy]] p.&nbsp;137
|-
|Externally commutative semigroup
|
*''axb'' = ''bxa''
|[[#Nagy|Nagy]] p.&nbsp;175
|-
|Medial semigroup
|
*''xaby'' = ''xbay''
|[[#Nagy|Nagy]] p.&nbsp;119
|-
|E-''k'' semigroup (''k'' fixed)
|
*(''ab'')<sup>''k''</sup> = ''a''<sup>''k''</sup>''b''<sup>''k''</sup>
|[[#Nagy|Nagy]] p.&nbsp;183
|-
|[[Exponential]] semigroup
|
*(''ab'')<sup>''m''</sup> = ''a''<sup>''m''</sup>''b''<sup>''m''</sup> for all ''m''
|[[#Nagy|Nagy]] p.&nbsp;183
|-
|WE-''k'' semigroup (''k'' fixed)
|
*There is a positive integer ''j'' depending on the couple (a,b) such that (''ab'')<sup>''k''+''j''</sup> = ''a''<sup>''k''</sup>''b''<sup>''k''</sup> (''ab'')<sup>''j''</sup> = (''ab'')<sup>''j''</sup>''a''<sup>''k''</sup>''b''<sup>''k''</sup>
|[[#Nagy|Nagy]] p.&nbsp;199
|-
|Weakly [[exponential]] semigroup
|
*WE-''m'' for all ''m''
|[[#Nagy|Nagy]] p.&nbsp;215
|-
|[[Cancellative semigroup]]
|
*''ax = ay ''  &nbsp; ⇒ &nbsp;  ''x = y''
*''xa = ya  ''  &nbsp;  ⇒  &nbsp;  ''x = y''
|[[#C&P|C&P]] p.&nbsp;3
|-
|[[Cancellative semigroup|Right cancellative semigroup]]
|
*''xa = ya ''  &nbsp;  ⇒  &nbsp;  ''x = y''
|[[#C&P|C&P]] p.&nbsp;3
|-
|[[Cancellative semigroup|Left cancellative semigroup]]
|
*''ax = ay ''  &nbsp;  ⇒  &nbsp;  ''x = y''
|[[#C&P|C&P]] p.&nbsp;3
|-
|''E''-[[inversive]] semigroup
|
*There exists ''x'' such that ''ax'' ∈ ''E''.
|[[#C&P|C&P]] p.&nbsp;98
|-
|[[Regular semigroup]]
|
*There exists ''x'' such that ''axa'' =''a''.
|[[#C&P|C&P]] p.&nbsp;26
|-
|Intra-regular semigroup
|
*There exist ''x'' and ''y'' such that ''xa''<sup>2</sup>''y'' = ''a''.
|[[#C&P|C&P]] p.&nbsp;121
|-
|Left regular semigroup
|
*There exists ''x''  such that ''xa''<sup>2</sup> = ''a''.
|[[#C&P|C&P]] p.&nbsp;121
|-
|Right regular semigroup
|
*There exists ''x''  such that ''a''<sup>2</sup>''x'' = ''a''.
|[[#C&P|C&P]] p.&nbsp;121
|-
|[[Completely regular semigroup]]
|
*''H''<sub>''a''</sup> is  a group.
|[[#Gril|Gril]] p.&nbsp;75
|-
|(inverse) [[Clifford semigroup]]
|
*A regular semigroup in which all idempotents are central.
|[[#Pet|Petrich]] p.&nbsp;65
|-
|''k''-regular semigroup (''k'' fixed)
|
*There exists ''x'' such that  ''a''<sup>''k''</sup>''xa''<sup>''k''</sup> = ''a''<sup>''k''</sup>.
|[[#Hari|Hari]]
|-
|Eventually regular semigroup<br>(π-regular semigroup, <br>Quasi regular semigroup)
|
*There exists ''k'' and ''x'' (depending on ''a'') such that ''a''<sup>''k''</sup>''xa''<sup>''k''</sup> = ''a''<sup>''k''</sup>.
|[[#Edwa|Edwa]]<br/>[[#Shum|Shum]]<br/>[[#Higg|Higg]] p.&nbsp;49
|-
|Quasi-periodic semigroup, [[epigroup]], group-bound semigroup, completely (or strongly) π-regular semigroup, and many other; see [[#Kela|Kela]] for a list)
|
*There exists ''k'' (depending on ''a'') such that ''a''<sup>''k''</sup> belongs to a [[subgroup]] of ''S''
|[[#Kela|Kela]]<br/>[[#Gril|Gril]] p.&nbsp;110<br>[[#Higg|Higg]] p.&nbsp;4
|-
|Primitive semigroup
|
*If ''0'' ≠ ''e'' and ''f'' = ''ef'' = ''fe'' then ''e'' = ''f''.
|[[#C&P|C&P]] p.&nbsp;26
|-
|Unit regular semigroup
|
*There exists ''u'' in ''G'' such that ''aua'' = ''a''.
|[[#Tvm|Tvm]]
|-
|Strongly unit regular semigroup
|
*There exists ''u'' in ''G'' such that ''aua'' = ''a''.
*''e D f'' ⇒ ''f'' = ''v''<sup>−1</sup>''ev'' for some ''v'' in ''G''.
|[[#Tvm|Tvm]]
|-
|[[Orthodox semigroup]]
|
*There exists ''x'' such that ''axa'' = ''a''.
*''E'' is a subsemigroup of ''S''.
|[[#Gril|Gril]] p.&nbsp;57<br/>[[#Howi|Howi]] p.&nbsp;226
|-
|[[Inverse semigroup]]
|
*There exists unique ''x''  such that ''axa'' = ''a'' and ''xax'' = ''x''.
|[[#C&P|C&P]] p.&nbsp;28
|-
|Left inverse semigroup <br>(''R''-unipotent)
|
*''R''<sub>''a''</sub> contains a unique ''h''.
|[[#Gril|Gril]] p.&nbsp;382
|-
|Right inverse semigroup<br>(''L''-unipotent)
|
*''L''<sub>''a''</sub> contains a unique ''h''.
|[[#Gril|Gril]] p.&nbsp;382
|-
|Locally inverse semigroup <br>(Pseudoinverse semigroup)
|
*There exists ''x'' such that ''axa'' = ''a''.
*''E'' is a pseudosemilattice.
|[[#Gril|Gril]] p.&nbsp;352
|-
|''M''-inversive semigroup
|
*There exist ''x'' and ''y'' such that ''baxc'' = ''bc'' and ''byac'' = ''bc''.
|[[#C&P|C&P]] p.&nbsp;98
|-
|Pseudoinverse semigroup<br>(Locally inverse semigroup)
|
*There exists ''x'' such that ''axa'' = ''a''.
* ''E'' is a pseudosemilattice.
|[[#Gril|Gril]] p.&nbsp;352
|-
|Abundant semigroups
|
*The classes ''L''*<sub>''a''</sub>  and ''R''*<sub>''a''</sub>, where ''a'' ''L''* ''b'' if ''ac'' =  ''ad'' ⇔ ''bc'' = ''bd'' and  ''a'' ''R''* ''b'' if ''ca'' =  ''da'' ⇔ ''cb'' = ''db'', contain idempotents.
|[[#Chen|Chen]]
|-
|Rpp-semigroup<br>(Right principal projective semigroup)
|
*The class ''L''*<sub>''a''</sub>, where ''a'' ''L''* ''b'' if ''ac'' =  ''ad'' ⇔ ''bc'' = ''bd'', contains at least one idempotent.
|[[#Shum|Shum]]
|-
|Lpp-semigroup<br>(Left principal projective semigroup)
|
*The class ''R''*<sub>''a''</sub>, where ''a'' ''R''* ''b'' if ''ca'' =  ''da'' ⇔ ''cb'' = ''db'', contains at least one idempotent.
|[[#Shum|Shum]]
|-
|[[Null semigroup]] <br>([[Zero semigroup]])
|
*0 ∈ ''S''
*''ab'' = 0
|[[#C&P|C&P]] p.&nbsp;4
|-
|[[Zero semigroup]]<br>([[Null semigroup]])
|
*0 ∈ ''S''
*''ab'' = 0
|[[#C&P|C&P]] p.&nbsp;4
|-
|[[Left zero semigroup]]
|
*''ab'' = ''a''
|[[#C&P|C&P]] p.&nbsp;4
|-
|[[Right zero semigroup]]
|
*''ab'' = ''b''
|[[#C&P|C&P]] p.&nbsp;4
|-
|Unipotent semigroup
|
*''E'' is singleton.
|[[#C&P|C&P]] p.&nbsp;21
|-
|Left reductive semigroup
|
*If ''xa'' = ''xb'' for all ''x'' implies ''a'' = ''b''.
|[[#C&P|C&P]] p.&nbsp;9
|-
|Right reductive semigroup
|
*If ''ax'' = ''bx'' for all ''x'' implies ''a'' = ''b''.
|[[#C&P|C&P]] p.&nbsp;4
|-
|Reductive semigroup
|
*If ''xa'' = ''xb'' for all ''x'' implies ''a'' = ''b''.
*If ''ax'' = ''bx'' for all ''x'' implies ''a'' = ''b''.
|[[#C&P|C&P]] p.&nbsp;4
|-
|Separative semigroup
|
*''ab'' = ''a''<sup>2</sup> = ''b''<sup>2</sup>  &nbsp;  ⇒  &nbsp;  ''a'' = ''b''
|[[#C&P|C&P]] p.&nbsp;130–131
|-
|Reversible semigroup
|
*''Sa'' ∩ ''Sb'' ≠ Ø
*''aS'' ∩ ''bS'' ≠ Ø
|[[#C&P|C&P]] p.&nbsp;34
|-
|Right reversible semigroup
|
*''Sa'' ∩ ''Sb'' ≠ Ø
|[[#C&P|C&P]] p.&nbsp;34
|-
|Left reversible semigroup
|
*''aS'' ∩ ''bS'' ≠ Ø
|[[#C&P|C&P]] p.&nbsp;34
|-
|[[Aperiodic semigroup]]<br>
|
* There exists ''k'' (depending on ''a'') such that a<sup>k</sup> = a<sup>k+1</sup>
|[[#KKM|KKM]] p.&nbsp;29<br/>
|-
|ω-semigroup
|
*E is countable descending chain under the order ''a'' ≤<sub>''H''</sub> ''b''
|[[#Gril|Gril]] p.&nbsp;233–238
|-
|Left Clifford semigroup<br>(LC-semigroup)
|
*''aS'' ⊆ ''Sa''
|[[#Shum|Shum]]
|-
|Right Clifford semigroup<br>(RC-semigroup)
|
*''Sa'' ⊆ ''aS''
|[[#Shum|Shum]]
|-
|LC-semigroup <br>(Left Clifford semigroup)
|
*''aS'' ⊆ ''Sa''
|[[#Shum|Shum]]
|-
|RC-semigroup<br>(Right Clifford semigroup)
|
*''Sa'' ⊆ ''aS''
|[[#Shum|Shum]]
|-
|Orthogroup
|
*''H''<sub>''a''</sub> is a group.
*''E'' is a subsemigroup of ''S''
|[[#Shum|Shum]]
|-
|Complete commutative semigroup
|
*''ab'' = ''ba''
* ''a''<sup>''k''</sup> is in a subgroup of ''S'' for some ''k''.
*Every nonempty subset of ''E'' has an infimum.
|[[#Gril|Gril]] p.&nbsp;110
|-
|Nilsemigroup
|
*0 ∈ ''S''
*''a''<sup>''k''</sup> = 0 for some ''k''.
|[[#Gril|Gril]] p.&nbsp;99
|-
|Elementary semigroup
|
*''ab'' =  ''ba''
*''S'' = ''G'' ∪ ''N'' where ''G'' is a group, ''N'' is a nilsemigroup or a one-element semigroup.
*''N'' is ideal of ''S''.
*Identity of ''G'' is 1 of ''S'' and zero of ''N'' is 0 of ''S''.
|[[#Gril|Gril]] p.&nbsp;111
|-
|''E''-unitary semigroup
|
*There exists unique ''x'' such that ''axa'' = ''a'' and ''xax'' = ''x''.
*''ea'' = ''e'' &nbsp; ⇒ &nbsp; ''a'' ∈ ''E''
|[[#Gril|Gril]] p.&nbsp;245
|-
|Finitely presented semigroup
|
*''S'' has a presentation ( ''X''; ''R'' ) in which ''X'' and ''R'' are finite.
|[[#Gril|Gril]] p.&nbsp;134
|-
|Fundamental semigroup
|
*Equality on ''S'' is the only congruence contained in ''H''.
|[[#Gril|Gril]] p.&nbsp;88
|-
|Idempotent generated semigroup
|
*''S'' is equal to the semigroup generated by ''E''.
|[[#Gril|Gril]] p.&nbsp;328
|-
|Locally finite semigroup
|
*Every finitely generated subsemigroup of ''S'' is finite.
|[[#Gril|Gril]] p.&nbsp;161
|-
|''N''-semigroup
|
*''ab'' = ''ba''
*There exists ''x'' and a positive integer ''n'' such that ''a'' =  ''xb''<sup>n</sup>.
*''ax = ay ''  &nbsp; ⇒ &nbsp;  ''x = y''
*''xa = ya  ''  &nbsp;  ⇒  &nbsp;  ''x = y''
*''E'' = Ø
|[[#Gril|Gril]] p.&nbsp;100
|-
|''L''-unipotent semigroup <br>(Right inverse semigroup)
|
*''L''<sub>''a''</sub> contains a unique ''e''.
|[[#Gril|Gril]] p.&nbsp;362
|-
|''R''-unipotent semigroup <br> (Left inverse semigroup)
|
*''R''<sub>''a''</sub> contains a unique ''e''.
|[[#Gril|Gril]] p.&nbsp;362
|-
|Left simple semigroup
|
*''L''<sub>''a''</sup> = ''S''
|[[#Gril|Gril]] p.&nbsp;57
|-
|Right simple semigroup
|
*''R''<sub>''a''</sup> = ''S''
|[[#Gril|Gril]] p.&nbsp;57
|-
|Subelementary semigroup
|
*''ab'' =  ''ba''
* ''S'' = ''C'' ∪ ''N'' where ''C'' is a cancellative semigroup, ''N'' is a nilsemigroup or a one-element semigroup.
*''N'' is ideal of ''S''.
*Zero of ''N'' is 0 of ''S''.
*For ''x'', ''y'' in ''S'' and ''c'' in ''C'', ''cx'' = ''cy'' implies that ''x'' = ''y''.
|[[#Gril|Gril]] p.&nbsp;134
|-
|Symmetric semigroup<br>([[Transformation semigroup|Full transformation semigroup]])
|
*Set of all mappings of ''X'' into itself with composition of mappings as binary operation.
|[[#C&P|C&P]] p.&nbsp;2
|-
|Weakly reductive semigroup
|
*If ''xz'' = ''yz'' and ''zx'' = ''zy'' for all ''z'' in ''S'' then ''x'' = ''y''.
|[[#C&P|C&P]] p.&nbsp;11
|-
|Right unambiguous semigroup
|
*If ''x'', ''y'' ≥<sub>''R''</sub> ''z'' then ''x''  ≥<sub>''R''</sub> ''y'' or ''y'' ≥<sub>''R''</sub> ''x''.
|[[#Gril|Gril]] p.&nbsp;170
|-
|Left unambiguous semigroup
|
*If ''x'', ''y'' ≥<sub>''L''</sub> ''z'' then ''x''  ≥<sub>''L''</sub> ''y'' or ''y'' ≥<sub>''L''</sub> ''x''.
|[[#Gril|Gril]] p.&nbsp;170
|-
|Unambiguous semigroup
|
*If ''x'', ''y'' ≥<sub>''R''</sub> ''z'' then ''x''  ≥<sub>''R''</sub> ''y'' or ''y'' ≥<sub>''R''</sub> ''x''.
*If ''x'', ''y'' ≥<sub>''L''</sub> ''z'' then ''x''  ≥<sub>''L''</sub> ''y'' or ''y'' ≥<sub>''L''</sub> ''x''.
|[[#Gril|Gril]] p.&nbsp;170
|-
|Left 0-unambiguous
|
*0∈ ''S''
*0 ≠ ''x'' ≤<sub>''L''</sub> ''y'', ''z'' &nbsp; ⇒ &nbsp; ''y'' ≤<sub>''L''</sub> ''z'' or ''z'' ≤<sub>''L''</sub> ''y''
|[[#Gril|Gril]] p.&nbsp;178
|-
|Right 0-unambiguous
|
*0∈ ''S''
*0 ≠ ''x'' ≤<sub>''R''</sub> ''y'', ''z'' &nbsp; ⇒ &nbsp; ''y'' ≤<sub>''L''</sub> ''z'' or ''z'' ≤<sub>''R''</sub> ''y''
|[[#Gril|Gril]] p.&nbsp;178
|-
|0-unambiguous semigroup
|
*0∈ ''S''
*0 ≠ ''x'' ≤<sub>''L''</sub> ''y'', ''z'' &nbsp; ⇒ &nbsp; ''y'' ≤<sub>''L''</sub> ''z'' or ''z'' ≤<sub>''L''</sub> ''y''
*0 ≠ ''x'' ≤<sub>''R''</sub> ''y'', ''z'' &nbsp; ⇒ &nbsp; ''y'' ≤<sub>''L''</sub> ''z'' or ''z'' ≤<sub>''R''</sub> ''y''
|[[#Gril|Gril]] p.&nbsp;178
|-
|Left Putcha semigroup
|
*''a'' ∈ ''bS''<sup>1</sup> &nbsp; ⇒ &nbsp; ''a''<sup>''n''</sup> ∈ ''b''<sup>2</sup>''S''<sup>1</sup> for some ''n''.
|[[#Nagy|Nagy]] p.&nbsp;35
|-
|Right Putcha semigroup
|
*''a'' ∈ ''S''<sup>1</sup>''b'' &nbsp; ⇒ &nbsp; ''a''<sup>''n''</sup> ∈ ''S''<sup>1</sup>''b''<sup>2</sup> for some ''n''.
|[[#Nagy|Nagy]]  p.&nbsp;35
|-
|Putcha semigroup
|
*''a'' ∈ ''S''<sup>1</sup>''b'' ''S''<sup>1</sup> &nbsp; ⇒ &nbsp; ''a''<sup>''n''</sup> ∈ ''S''<sup>1</sup>''b''<sup>2</sup>''S''<sup>1</sup> for some positive integer ''n''
|[[#Nagy|Nagy]]  p.&nbsp;35
|-
|Bisimple semigroup<br>(''D''-simple semigroup)
|
*''D''<sub>''a''</sub> = ''S''
|[[#C&P|C&P]] p.&nbsp;49
|-
|0-bisimple semigroup
|
*0 ∈ ''S''
* ''S'' - {0} is a ''D''-class of ''S''.
|[[#C&P|C&P]] p.&nbsp;76
|-
|Completely simple semigroup
|
*There exists no ''A'' ⊆ ''S'', ''A'' ≠ ''S'' such that  ''SA'' ⊆ ''A'' and  ''AS'' ⊆ ''A''.
*There exists ''h'' in ''E'' such that whenever ''hf'' = ''f''  and  ''fh'' = '' f ''  we have ''h'' = ''f''.
|[[#C&P|C&P]] p.&nbsp;76
|-
|Completely 0-simple semigroup
|
*0 ∈ ''S''
* ''S''<sup>2</sup> ≠ 0
* If ''A'' ⊆ ''S'' is such that ''AS'' ⊆ ''A'' and ''SA'' ⊆ ''A'' then ''A'' = 0.
* There exists non-zero ''h'' in ''E'' such that whenever ''hf'' = ''f'',  ''fh'' = ''f'' and ''f'' ≠ 0  we have ''h'' = ''f''.
|[[#C&P|C&P]] p.&nbsp;76
|-
|''D''-simple semigroup<br>(Bisimple semigroup)
|
*''D''<sub>''a''</sub> = ''S''
|[[#C&P|C&P]] p.&nbsp;49
|-
|Semisimple semigroup
|
*Let ''J''(''a'') = ''S''<sup>1</sup>''aS''<sup>1</sup>, ''I''(''a'') = ''J''(''a'') − ''J''<sub>''a''</sub>. Each Rees factor semigroup ''J''(''a'')/''I''(''a'') is 0-simple or simple.
|[[#C&P|C&P]] p.&nbsp;71–75
|-
|Simple semigroup
|
* ''J<sub>a</sub>'' = ''S''. (There exists no ''A'' ⊆ ''S'', ''A'' ≠ ''S'' such that  ''SA'' ⊆ ''A'' and  ''AS'' ⊆ ''A''.)
|[[#C&P|C&P]] p.&nbsp;5<br/>[[#Higg|Higg]] p.&nbsp;16
|-
|0-simple semigroup
|
*0 ∈ ''S''
* ''S''<sup>2</sup> ≠ 0
* If ''A'' ⊆ ''S'' is such that ''AS'' ⊆ ''A'' and ''SA'' ⊆ ''A'' then ''A'' = 0.
|[[#C&P|C&P]] p.&nbsp;67
|-
|Left 0-simple semigroup
|
*0 ∈ ''S''
*''S''<sup>2</sup> ≠ 0
* If ''A'' ⊆ ''S'' is such that  ''SA'' ⊆ ''A'' then ''A'' = 0.
|[[#C&P|C&P]] p.&nbsp;67
|-
|Right 0-simple semigroup
|
*0 ∈ ''S''
* ''S''<sup>2</sup> ≠ 0
* If ''A'' ⊆ ''S'' is such that ''AS'' ⊆ ''A''  then ''A'' = 0.
|[[#C&P|C&P]] p.&nbsp;67
|-
|[[Cyclic semigroup]] <br>([[Monogenic semigroup]])
|
*''S'' = { ''w'', ''w''<sup>2</sup>,  ''w''<sup>3</sup>, ... } for some ''w'' in ''S''
|[[#C&P|C&P]] p.&nbsp;19
|-
| [[Monogenic semigroup]]<br>([[Cyclic semigroup]])
|
*''S'' = { ''w'', ''w''<sup>2</sup>,  ''w''<sup>3</sup>, ... } for some ''w'' in ''S''
|[[#C&P|C&P]] p.&nbsp;19
|-
|Periodic semigroup
|
*{ ''a'', ''a''<sup>2</sup>, ''a''<sup>3</sup>, ... } is a finite set.
|[[#C&P|C&P]] p.&nbsp;20
|-
|[[Bicyclic semigroup]]
|
*1 ∈ S
* ''S'' generated by { ''x''<sub>1</sub>, ''x''<sub>2</sub> } with ''x''<sub>1</sub>''x''<sub>2</sub> = 1.
|[[#C&P|C&P]] p.&nbsp;43–46
|-
|[[Full transformation semigroup]] ''T''<sub>''X''</sub><br>(Symmetric semigroup)
|
*[[Set (mathematics)|Set]] of all [[Map (mathematics)|mappings]] of ''X'' into itself with [[Composition of functions|composition of mappings]] as [[binary operation]].
|[[#C&P|C&P]] p.&nbsp;2
|-
|Rectangular semigroup
|
*Whenever three of ''ax'', ''ay'', ''bx'', ''by'' are equal, all four are equal.
|[[#C&P|C&P]] p.&nbsp;97
|-
|[[Symmetric inverse semigroup]] ''I''<sub>''X''</sub>
|
*The semigroup of [[bijection|one-to-one]] [[partial function|partial transformations]] of ''X''.
|[[#C&P|C&P]] p.&nbsp;29
|-
|[[Brandt semigroup]]
|
*0 ∈ ''S''
* ( ''ac'' = ''bc'' ≠ 0 or ''ca'' = ''cb'' ≠ 0 )  &nbsp;  ⇒  &nbsp; ''a'' = ''b''
* ( ''ab'' ≠ 0 and ''bc'' ≠ 0 )  &nbsp;  ⇒  &nbsp; ''abc'' ≠ 0
* If ''a'' ≠ 0 there exist unique ''x'', ''y'', ''z'', such that ''xa'' = ''a'', ''ay'' = ''a'', ''za'' = ''y''.
* ( ''e'' ≠ 0 and  ''f'' ≠ 0 )  &nbsp;  ⇒  &nbsp; ''eSf '' ≠ 0.
|[[#C&P|C&P]] p.&nbsp;101
|-
|[[Free semigroup]] ''F''<sub>''X''</sub>
|
*Set of finite sequences of elements of ''X'' with the operation<br>( ''x''<sub>1</sub>, ..., ''x''<sub>m</sub> ) ( ''y''<sub>1</sub>, ..., ''y''<sub>n</sub> ) = ( ''x''<sub>1</sub>, ..., ''x''<sub>m</sub>, ''y''<sub>1</sub>, ..., ''y''<sub>n</sub> )
|[[#Gril|Gril]] p.&nbsp;18
|-
|Rees [[Matrix (mathematics)|matrix]] semigroup
|
*''G''<sup>0</sup> a group ''G'' with 0 adjoined.
*''P'' :  Λ × ''I'' → ''G''<sup>0</sup> a map.
* Define an operation in ''I'' × ''G''<sup>0</sup> × Λ  by ( ''i'', ''g'', λ ) ( ''j'', ''h'', μ ) = ( ''i'', ''g'' P( λ, ''j'' ) ''h'', μ ).
* ( ''I'', ''G''<sup>0</sup>, Λ )/( ''I'' × { 0 } × Λ )  is the Ress matrix semigroup ''M''<sup>0</sup> ( ''G''<sup>0</sup>; ''I, Λ ; ''P'' ).
|[[#C&P|C&P]] p.88
|-
|Semigroup of [[linear transformation]]s
|
*Semigroup of [[linear transformation]]s of a [[vector space]] ''V'' over a [[field (mathematics)|field]] ''F'' under [[composition of functions]].
|[[#C&P|C&P]] p.57
|-
|Semigroup of [[binary relation]]s ''B''<sub>''X''</sub>
|
*Set of all [[binary relation]]s on ''X'' under [[composition of relations|composition]]
|[[#C&P|C&P]] p.13
|-
|[[Numerical semigroup]]
|
*0 ∈ ''S'' ⊆ ''N'' = { 0,1,2, ... } under + .
*''N'' - ''S'' is finite
|[[#Delg|Delg]]
|-
|[[Semigroup with involution]]<br>(*-semigroup)
|
*There exists a unary operation ''a'' → ''a''* in ''S'' such that ''a''** = ''a'' and (''ab'')* = ''b''*''a''*.
|[[#Howi|Howi]]
|-
|*-semigroup<br>([[Semigroup with involution]])
|
*There exists a unary operation ''a'' → ''a''* in ''S'' such that ''a''** = ''a'' and (''ab'')* = ''b''*''a''*.
|[[#Howi|Howi]]
|-
|Baer–Levi semigroup
|
*Semigroup of one-to-one transformations ''f'' of  ''X'' such that ''X'' − ''f'' ( ''X'' ) is infinite.
|[[#C&P II|C&P II]] Ch.8
|-
|''U''-semigroup
|
*There exists a unary operation ''a'' → ''a''’ in ''S'' such that ( ''a''’)’ = ''a''.
|[[#Howi|Howi]] p.102
|-
|''I''-semigroup
|
*There exists a unary operation ''a'' → ''a''’ in ''S'' such that ( ''a''’)’ = ''a'' and ''aa''’''a'' = ''a''.
|[[#Howi|Howi]] p.102
|-
|[[Semiband]]
|
*A regular semigroup generated by its idempotents.
|[[#Howi|Howi]] p.230
|-
|[[Group (mathematics)|Group]]
|
*There exists ''h'' such that for all a, ''ah'' = ''ha'' = ''a''.
*There exists ''x'' (depending on ''a'') such that ''ax'' = ''xa'' = ''h''.
|
|}
 
</center>
 
==References==
 
{|
|-valign="top"
| [C&P]
| {{Anchor|C&P}}A H Clifford, G B Preston (1964). ''The Algebraic Theory of Semigroups Vol. I'' (Second Edition). [[American Mathematical Society]].  ISBN 978-0-8218-0272-4
|-valign="top"
|[C&P II] &nbsp;
|{{Anchor|C&P II}}A H Clifford, G B Preston (1967). ''The Algebraic Theory of Semigroups Vol. II'' (Second Edition). [[American Mathematical Society]].  ISBN 0-8218-0272-0
|-valign="top"
| [Chen]&nbsp;
| {{Anchor|Chen}}Hui Chen (2006), "Construction of a kind of abundant semigroups", ''Mathematical Communications'' ('''11'''), 165–171 (Accessed on 25 April 2009)
|-valign="top"
|[Delg]
|{{Anchor|Delg}}M Delgado, ''et al.'', ''Numerical semigroups'', [http://www.gap-system.org/Manuals/pkg/numericalsgps/doc/manual.pdf] (Accessed on 27 April 2009)
|-valign="top"
|[Edwa]
|{{Anchor|Edwa}}P Edwards (1983), "Eventually regular semigroups", ''Bulletin of Australian Mathematical Society'' '''28''', 23–38
|-valign="top"
|[Gril]
|{{Anchor|Gril}}P A Grillet (1995). ''Semigroups''. [[CRC Press]].  ISBN 978-0-8247-9662-4
|-valign="top"
|[Hari]
|{{Anchor|Hari}}K S Harinath (1979), "Some results on ''k''-regular semigroups", ''Indian Journal of Pure and Applied Mathematics'' '''10'''(11), 1422–1431
|-valign="top"
|[Howi]
|{{Anchor|Howi}}J M Howie (1995), ''Fundamentals of Semigroup Theory'', [[Oxford University Press]]
|-valign="top"
|[Nagy]
|{{Anchor|Nagy}}Attila Nagy (2001). ''Special Classes of Semigroups''. [[Springer Science+Business Media|Springer]]. ISBN 978-0-7923-6890-8
|-valign="top"
|[Pet]
|{{Anchor|Pet}} M Petrich, N R Reilly (1999). ''Completely regular semigroups''. [[John Wiley & Sons]].  ISBN 978-0-471-19571-9
|-valign="top"
|[Shum] &nbsp; &nbsp;
|{{Anchor|Shum}}K P Shum "Rpp semigroups, its generalizations and special subclasses" in ''Advances in Algebra and Combinatorics'' edited by K P Shum et al. (2008), [[World Scientific]],  ISBN 981-279-000-4 (pp.&nbsp;303–334)
|-valign="top"
|[Tvm]
|{{Anchor|Tvm}}''Proceedings of the International Symposium on Theory of Regular Semigroups and Applications'', [[University of Kerala]], [[Thiruvananthapuram]], [[India]], 1986
|-valign="top"
|[Kela]
|{{Anchor|Kela}}A. V. Kelarev, ''Applications of epigroups to graded ring theory'', Semigroup Forum, Volume 50, Number 1 (1995), 327-350 {{doi|10.1007/BF02573530}} <!-- we could use almost any other paper by the Russian group here, but this one has most synonyms given in its introduction.-->
|-valign="top"
|[KKM]
|{{Anchor|KKM}}Mati Kilp, Ulrich Knauer, Alexander V. Mikhalev (2000), ''Monoids, Acts and Categories: with Applications to Wreath Products and Graphs'', Expositions in Mathematics '''29''', Walter de Gruyter, Berlin, ISBN 978-3-11-015248-7.
|-valign="top"
|[Higg]
|{{Anchor|Higg}} {{cite book|author=Peter M. Higgins|title=Techniques of semigroup theory|year=1992|publisher=Oxford University Press|isbn=978-0-19-853577-5}}
|}
 
[[Category:Algebraic structures]]
[[Category:Semigroup theory]]

Latest revision as of 19:48, 16 April 2013

Template:Cleanup In mathematics, a semigroup is a nonempty set together with an associative binary operation. A special class of semigroups is a class of semigroups satisfying additional properties or conditions. Thus the class of commutative semigroups consists of all those semigroups in which the binary operation satisfies the commutativity property that ab = ba for all elements a and b in the semigroup. The class of finite semigroups consists of those semigroups for which the underlying set has finite cardinality. Members of the class of Brandt semigroups are required to satisfy not just one condition but a set of additional properties. A large variety of special classes of semigroups have been defined though not all of them have been studied equally intensively.

In the algebraic theory of semigroups, in constructing special classes, attention is focused only on those properties, restrictions and conditions which can be expressed in terms of the binary operations in the semigroups and occasionally on the cardinality and similar properties of subsets of the underlying set. The underlying sets are not assumed to carry any other mathematical structures like order or topology.

As in any algebraic theory, one of the main problems of the theory of semigroups is the classification of all semigroups and a complete description of their structure. In the case of semigroups, since the binary operation is required to satisfy only the associativity property the problem of classification is considered extremely difficult. Descriptions of structures have been obtained for certain special classes of semigroups. For example the structure of the sets of idempotents of regular semigroups is completely known. Structure descriptions are presented in terms of better known types of semigroups. The best known type of semigroup is the group.

A (necessarily incomplete) list of various special classes of semigroups is presented below. To the extent possible the defining properties are formulated in terms of the binary operations in the semigroups. The references point to the locations from where the defining properties are sourced.

Notations

In describing the defining properties of the various special classes of semigroups, the following notational conventions are adopted.

Notations
Notation Meaning
S Arbitrary semigroup
E Set of idempotents in S
G Group of units in S
X Arbitrary set
a, b, c Arbitrary elements of S
x, y, z Specific elements of S
e, f. g Arbitrary elements of E
h Specific element of E
l, m, n Arbitrary positive integers
j, k Specific positive integers
0 Zero element of S
1 Identity element of S
S1 S if 1 ∈ S; S ∪ { 1 } if 1 ∉ S
L, R, H, D, J Green's relations
La, Ra, Ha, Da, Ja Green classes containing a
aL b
aR b
aH b
S1aS1b
aS1bS1
S1aS1b and aS1bS1

List of special classes of semigroups

List of special classes of semigroups
Terminology Defining property Reference(s)
Finite semigroup
Empty semigroup
Trivial semigroup
  • Cardinality of S is 1.
Monoid
  • 1 ∈ S
Gril p. 3
Band
(Idempotent semigroup)
  • a2 = a
C&P p. 4
Semilattice
  • a2 = a
  • ab = ba
C&P p. 24
Commutative semigroup
  • ab = ba
C&P p. 3
Archimedean commutative semigroup
  • ab = ba
  • There exists x and k such that a = xbk.
C&P p. 131
Nowhere commutative semigroup
  • ab = ba   ⇒   a = b
C&P p. 26
Left weakly commutative
  • There exist x and k such that (ab)k = bx.
Nagy p. 59
Right weakly commutative
  • There exist x and k such that (ab)k = xb.
Nagy p. 59
Weakly commutative
  • There exist x and j such that (ab)j = bx.
  • There exist y and k such that (ab)k = yb.
Nagy p. 59
Conditionally commutative semigroup
  • If ab = ba then axb = bxa for all x.
Nagy p. 77
R-commutative semigroup
  • ab R ba
Nagy p. 69–71
RC-commutative semigroup
  • R-commutative and conditionally commutative
Nagy p. 93–107
L-commutative semigroup
  • ab L ba
Nagy p. 69–71
LC-commutative semigroup
  • L-commutative and conditionally commutative
Nagy p. 93–107
H-commutative semigroup
  • ab H ba
Nagy p. 69–71
Quasi-commutative semigroup
  • ab = (ba)k for some k.
Nagy p. 109
Right commutative semigroup
  • xab = xba
Nagy p. 137
Left commutative semigroup
  • abx = bax
Nagy p. 137
Externally commutative semigroup
  • axb = bxa
Nagy p. 175
Medial semigroup
  • xaby = xbay
Nagy p. 119
E-k semigroup (k fixed)
  • (ab)k = akbk
Nagy p. 183
Exponential semigroup
  • (ab)m = ambm for all m
Nagy p. 183
WE-k semigroup (k fixed)
  • There is a positive integer j depending on the couple (a,b) such that (ab)k+j = akbk (ab)j = (ab)jakbk
Nagy p. 199
Weakly exponential semigroup
  • WE-m for all m
Nagy p. 215
Cancellative semigroup
  • ax = ay   ⇒   x = y
  • xa = ya   ⇒   x = y
C&P p. 3
Right cancellative semigroup
  • xa = ya   ⇒   x = y
C&P p. 3
Left cancellative semigroup
  • ax = ay   ⇒   x = y
C&P p. 3
E-inversive semigroup
  • There exists x such that axE.
C&P p. 98
Regular semigroup
  • There exists x such that axa =a.
C&P p. 26
Intra-regular semigroup
  • There exist x and y such that xa2y = a.
C&P p. 121
Left regular semigroup
  • There exists x such that xa2 = a.
C&P p. 121
Right regular semigroup
  • There exists x such that a2x = a.
C&P p. 121
Completely regular semigroup
  • Ha is a group.
Gril p. 75
(inverse) Clifford semigroup
  • A regular semigroup in which all idempotents are central.
Petrich p. 65
k-regular semigroup (k fixed)
  • There exists x such that akxak = ak.
Hari
Eventually regular semigroup
(π-regular semigroup,
Quasi regular semigroup)
  • There exists k and x (depending on a) such that akxak = ak.
Edwa
Shum
Higg p. 49
Quasi-periodic semigroup, epigroup, group-bound semigroup, completely (or strongly) π-regular semigroup, and many other; see Kela for a list)
  • There exists k (depending on a) such that ak belongs to a subgroup of S
Kela
Gril p. 110
Higg p. 4
Primitive semigroup
  • If 0e and f = ef = fe then e = f.
C&P p. 26
Unit regular semigroup
  • There exists u in G such that aua = a.
Tvm
Strongly unit regular semigroup
  • There exists u in G such that aua = a.
  • e D ff = v−1ev for some v in G.
Tvm
Orthodox semigroup
  • There exists x such that axa = a.
  • E is a subsemigroup of S.
Gril p. 57
Howi p. 226
Inverse semigroup
  • There exists unique x such that axa = a and xax = x.
C&P p. 28
Left inverse semigroup
(R-unipotent)
  • Ra contains a unique h.
Gril p. 382
Right inverse semigroup
(L-unipotent)
  • La contains a unique h.
Gril p. 382
Locally inverse semigroup
(Pseudoinverse semigroup)
  • There exists x such that axa = a.
  • E is a pseudosemilattice.
Gril p. 352
M-inversive semigroup
  • There exist x and y such that baxc = bc and byac = bc.
C&P p. 98
Pseudoinverse semigroup
(Locally inverse semigroup)
  • There exists x such that axa = a.
  • E is a pseudosemilattice.
Gril p. 352
Abundant semigroups
  • The classes L*a and R*a, where a L* b if ac = adbc = bd and a R* b if ca = dacb = db, contain idempotents.
Chen
Rpp-semigroup
(Right principal projective semigroup)
  • The class L*a, where a L* b if ac = adbc = bd, contains at least one idempotent.
Shum
Lpp-semigroup
(Left principal projective semigroup)
  • The class R*a, where a R* b if ca = dacb = db, contains at least one idempotent.
Shum
Null semigroup
(Zero semigroup)
  • 0 ∈ S
  • ab = 0
C&P p. 4
Zero semigroup
(Null semigroup)
  • 0 ∈ S
  • ab = 0
C&P p. 4
Left zero semigroup
  • ab = a
C&P p. 4
Right zero semigroup
  • ab = b
C&P p. 4
Unipotent semigroup
  • E is singleton.
C&P p. 21
Left reductive semigroup
  • If xa = xb for all x implies a = b.
C&P p. 9
Right reductive semigroup
  • If ax = bx for all x implies a = b.
C&P p. 4
Reductive semigroup
  • If xa = xb for all x implies a = b.
  • If ax = bx for all x implies a = b.
C&P p. 4
Separative semigroup
  • ab = a2 = b2   ⇒   a = b
C&P p. 130–131
Reversible semigroup
  • SaSb ≠ Ø
  • aSbS ≠ Ø
C&P p. 34
Right reversible semigroup
  • SaSb ≠ Ø
C&P p. 34
Left reversible semigroup
  • aSbS ≠ Ø
C&P p. 34
Aperiodic semigroup
  • There exists k (depending on a) such that ak = ak+1
KKM p. 29
ω-semigroup
  • E is countable descending chain under the order aH b
Gril p. 233–238
Left Clifford semigroup
(LC-semigroup)
  • aSSa
Shum
Right Clifford semigroup
(RC-semigroup)
  • SaaS
Shum
LC-semigroup
(Left Clifford semigroup)
  • aSSa
Shum
RC-semigroup
(Right Clifford semigroup)
  • SaaS
Shum
Orthogroup
  • Ha is a group.
  • E is a subsemigroup of S
Shum
Complete commutative semigroup
  • ab = ba
  • ak is in a subgroup of S for some k.
  • Every nonempty subset of E has an infimum.
Gril p. 110
Nilsemigroup
  • 0 ∈ S
  • ak = 0 for some k.
Gril p. 99
Elementary semigroup
  • ab = ba
  • S = GN where G is a group, N is a nilsemigroup or a one-element semigroup.
  • N is ideal of S.
  • Identity of G is 1 of S and zero of N is 0 of S.
Gril p. 111
E-unitary semigroup
  • There exists unique x such that axa = a and xax = x.
  • ea = e   ⇒   aE
Gril p. 245
Finitely presented semigroup
  • S has a presentation ( X; R ) in which X and R are finite.
Gril p. 134
Fundamental semigroup
  • Equality on S is the only congruence contained in H.
Gril p. 88
Idempotent generated semigroup
  • S is equal to the semigroup generated by E.
Gril p. 328
Locally finite semigroup
  • Every finitely generated subsemigroup of S is finite.
Gril p. 161
N-semigroup
  • ab = ba
  • There exists x and a positive integer n such that a = xbn.
  • ax = ay   ⇒   x = y
  • xa = ya   ⇒   x = y
  • E = Ø
Gril p. 100
L-unipotent semigroup
(Right inverse semigroup)
  • La contains a unique e.
Gril p. 362
R-unipotent semigroup
(Left inverse semigroup)
  • Ra contains a unique e.
Gril p. 362
Left simple semigroup
  • La = S
Gril p. 57
Right simple semigroup
  • Ra = S
Gril p. 57
Subelementary semigroup
  • ab = ba
  • S = CN where C is a cancellative semigroup, N is a nilsemigroup or a one-element semigroup.
  • N is ideal of S.
  • Zero of N is 0 of S.
  • For x, y in S and c in C, cx = cy implies that x = y.
Gril p. 134
Symmetric semigroup
(Full transformation semigroup)
  • Set of all mappings of X into itself with composition of mappings as binary operation.
C&P p. 2
Weakly reductive semigroup
  • If xz = yz and zx = zy for all z in S then x = y.
C&P p. 11
Right unambiguous semigroup
  • If x, yR z then xR y or yR x.
Gril p. 170
Left unambiguous semigroup
  • If x, yL z then xL y or yL x.
Gril p. 170
Unambiguous semigroup
  • If x, yR z then xR y or yR x.
  • If x, yL z then xL y or yL x.
Gril p. 170
Left 0-unambiguous
  • 0∈ S
  • 0 ≠ xL y, z   ⇒   yL z or zL y
Gril p. 178
Right 0-unambiguous
  • 0∈ S
  • 0 ≠ xR y, z   ⇒   yL z or zR y
Gril p. 178
0-unambiguous semigroup
  • 0∈ S
  • 0 ≠ xL y, z   ⇒   yL z or zL y
  • 0 ≠ xR y, z   ⇒   yL z or zR y
Gril p. 178
Left Putcha semigroup
  • abS1   ⇒   anb2S1 for some n.
Nagy p. 35
Right Putcha semigroup
  • aS1b   ⇒   anS1b2 for some n.
Nagy p. 35
Putcha semigroup
  • aS1b S1   ⇒   anS1b2S1 for some positive integer n
Nagy p. 35
Bisimple semigroup
(D-simple semigroup)
  • Da = S
C&P p. 49
0-bisimple semigroup
  • 0 ∈ S
  • S - {0} is a D-class of S.
C&P p. 76
Completely simple semigroup
  • There exists no AS, AS such that SAA and ASA.
  • There exists h in E such that whenever hf = f and fh = f we have h = f.
C&P p. 76
Completely 0-simple semigroup
  • 0 ∈ S
  • S2 ≠ 0
  • If AS is such that ASA and SAA then A = 0.
  • There exists non-zero h in E such that whenever hf = f, fh = f and f ≠ 0 we have h = f.
C&P p. 76
D-simple semigroup
(Bisimple semigroup)
  • Da = S
C&P p. 49
Semisimple semigroup
  • Let J(a) = S1aS1, I(a) = J(a) − Ja. Each Rees factor semigroup J(a)/I(a) is 0-simple or simple.
C&P p. 71–75
Simple semigroup
  • Ja = S. (There exists no AS, AS such that SAA and ASA.)
C&P p. 5
Higg p. 16
0-simple semigroup
  • 0 ∈ S
  • S2 ≠ 0
  • If AS is such that ASA and SAA then A = 0.
C&P p. 67
Left 0-simple semigroup
  • 0 ∈ S
  • S2 ≠ 0
  • If AS is such that SAA then A = 0.
C&P p. 67
Right 0-simple semigroup
  • 0 ∈ S
  • S2 ≠ 0
  • If AS is such that ASA then A = 0.
C&P p. 67
Cyclic semigroup
(Monogenic semigroup)
  • S = { w, w2, w3, ... } for some w in S
C&P p. 19
Monogenic semigroup
(Cyclic semigroup)
  • S = { w, w2, w3, ... } for some w in S
C&P p. 19
Periodic semigroup
  • { a, a2, a3, ... } is a finite set.
C&P p. 20
Bicyclic semigroup
  • 1 ∈ S
  • S generated by { x1, x2 } with x1x2 = 1.
C&P p. 43–46
Full transformation semigroup TX
(Symmetric semigroup)
C&P p. 2
Rectangular semigroup
  • Whenever three of ax, ay, bx, by are equal, all four are equal.
C&P p. 97
Symmetric inverse semigroup IX C&P p. 29
Brandt semigroup
  • 0 ∈ S
  • ( ac = bc ≠ 0 or ca = cb ≠ 0 )   ⇒   a = b
  • ( ab ≠ 0 and bc ≠ 0 )   ⇒   abc ≠ 0
  • If a ≠ 0 there exist unique x, y, z, such that xa = a, ay = a, za = y.
  • ( e ≠ 0 and f ≠ 0 )   ⇒   eSf ≠ 0.
C&P p. 101
Free semigroup FX
  • Set of finite sequences of elements of X with the operation
    ( x1, ..., xm ) ( y1, ..., yn ) = ( x1, ..., xm, y1, ..., yn )
Gril p. 18
Rees matrix semigroup
  • G0 a group G with 0 adjoined.
  • P : Λ × IG0 a map.
  • Define an operation in I × G0 × Λ by ( i, g, λ ) ( j, h, μ ) = ( i, g P( λ, j ) h, μ ).
  • ( I, G0, Λ )/( I × { 0 } × Λ ) is the Ress matrix semigroup M0 ( G0; I, Λ ; P ).
C&P p.88
Semigroup of linear transformations C&P p.57
Semigroup of binary relations BX C&P p.13
Numerical semigroup
  • 0 ∈ SN = { 0,1,2, ... } under + .
  • N - S is finite
Delg
Semigroup with involution
(*-semigroup)
  • There exists a unary operation aa* in S such that a** = a and (ab)* = b*a*.
Howi
*-semigroup
(Semigroup with involution)
  • There exists a unary operation aa* in S such that a** = a and (ab)* = b*a*.
Howi
Baer–Levi semigroup
  • Semigroup of one-to-one transformations f of X such that Xf ( X ) is infinite.
C&P II Ch.8
U-semigroup
  • There exists a unary operation aa’ in S such that ( a’)’ = a.
Howi p.102
I-semigroup
  • There exists a unary operation aa’ in S such that ( a’)’ = a and aaa = a.
Howi p.102
Semiband
  • A regular semigroup generated by its idempotents.
Howi p.230
Group
  • There exists h such that for all a, ah = ha = a.
  • There exists x (depending on a) such that ax = xa = h.

References

[C&P] <C&P>...</C&P>A H Clifford, G B Preston (1964). The Algebraic Theory of Semigroups Vol. I (Second Edition). American Mathematical Society. ISBN 978-0-8218-0272-4
[C&P II]   <C&P II>...</C&P II>A H Clifford, G B Preston (1967). The Algebraic Theory of Semigroups Vol. II (Second Edition). American Mathematical Society. ISBN 0-8218-0272-0
[Chen]  <Chen>...</Chen>Hui Chen (2006), "Construction of a kind of abundant semigroups", Mathematical Communications (11), 165–171 (Accessed on 25 April 2009)
[Delg] <Delg>...</Delg>M Delgado, et al., Numerical semigroups, [1] (Accessed on 27 April 2009)
[Edwa] <Edwa>...</Edwa>P Edwards (1983), "Eventually regular semigroups", Bulletin of Australian Mathematical Society 28, 23–38
[Gril] <Gril>...</Gril>P A Grillet (1995). Semigroups. CRC Press. ISBN 978-0-8247-9662-4
[Hari] <Hari>...</Hari>K S Harinath (1979), "Some results on k-regular semigroups", Indian Journal of Pure and Applied Mathematics 10(11), 1422–1431
[Howi] <Howi>...</Howi>J M Howie (1995), Fundamentals of Semigroup Theory, Oxford University Press
[Nagy] <Nagy>...</Nagy>Attila Nagy (2001). Special Classes of Semigroups. Springer. ISBN 978-0-7923-6890-8
[Pet] <Pet>...</Pet> M Petrich, N R Reilly (1999). Completely regular semigroups. John Wiley & Sons. ISBN 978-0-471-19571-9
[Shum]     <Shum>...</Shum>K P Shum "Rpp semigroups, its generalizations and special subclasses" in Advances in Algebra and Combinatorics edited by K P Shum et al. (2008), World Scientific, ISBN 981-279-000-4 (pp. 303–334)
[Tvm] <Tvm>...</Tvm>Proceedings of the International Symposium on Theory of Regular Semigroups and Applications, University of Kerala, Thiruvananthapuram, India, 1986
[Kela] <Kela>...</Kela>A. V. Kelarev, Applications of epigroups to graded ring theory, Semigroup Forum, Volume 50, Number 1 (1995), 327-350 21 year-old Glazier James Grippo from Edam, enjoys hang gliding, industrial property developers in singapore developers in singapore and camping. Finds the entire world an motivating place we have spent 4 months at Alejandro de Humboldt National Park.
[KKM] <KKM>...</KKM>Mati Kilp, Ulrich Knauer, Alexander V. Mikhalev (2000), Monoids, Acts and Categories: with Applications to Wreath Products and Graphs, Expositions in Mathematics 29, Walter de Gruyter, Berlin, ISBN 978-3-11-015248-7.
[Higg] <Higg>...</Higg> 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

My blog: http://www.primaboinca.com/view_profile.php?userid=5889534