A semigroup is a set $S$ together with a binary operation that is associative. Examples of semigroups are the set of finite strings over a fixed alphabet (under concatenation) and the positive integers (under addition, maximum, or minimum). Of course, any monoid or group is also a semigroup.
Synonyms
semigroup-theoryStats
created |
6 years ago by Dmitri Pavlov |
viewed |
3 times |
editors |
0 |
Top Answerers
more »Recent Hot Answers
Mapping from a finite index subgroup onto the whole groupHow many binary operations are associative?
Do these conditions on a semigroup define a group?
Is the semigroup M(n, Z) finitely presented? If so, where can I find a presentation of it?
What is the smallest variety of algebras containing all fields?
more »
Related Tags
gr.group-theory × 31
monoids × 27
reference-request × 21
operator-theory × 14
co.combinatorics × 12
terminology × 9
nt.number-theory × 5
formal-languages × 5
abstract-algebra × 5
pr.probability × 5
banach-spaces × 4
parabolic-pde × 4
order-theory × 4
lattices × 3
automata-theory × 3
more related tags