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 | |
Results tagged with semigroups-and-monoids
Search options not deleted
user 345
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.
4
votes
Accepted
Motivation and reference for Brauer algebras
For motivation I would advise starting with Brauer's original paper. You'll need a JSTOR login though:
https://www.jstor.org/stable/1968843?origin=crossref&seq=1#metadata_info_tab_contents
- 3,545
1
vote
Examples of left reversible semigroups
I suppose that the non-zero elements of a left Ore domain would work --- presumably this is why they are sometimes called Ore semigroups.
To expand: a ring is a left Ore domain if it has no non-trivi …
- 3,545