Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
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). A monoid is a semigroup with a neutral element. Of course, any group is also a monoid/semigroup.
2
votes
Accepted
More vocabulary for periodic elements in monoids
Question 1: See Clifford and Preston, volume 1.
Question 2: $m$ is the period, $n$ is called the index of the element. See this Wikipedia text.
Question 3: If $n=1$, the element is called a group elem …
5
votes
Accepted
Can every cancellative invertible-free monoid be embedded in a group?
No, it is not true even for finitely generated monoids. Take any semigroup $S$ which is cancellative and does not embed into a group (first examples were constructed by Malcev). Consider the monoid $S …