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 2900
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.
0
votes
0
answers
53
views
a generalization of group (monoid with order-by-order invertible elements)
Fix a filtered monoid, $H=H_0\supsetneq H_1\supsetneq H_2\supsetneq\cdots$. Suppose for any $h\in H$ and any $n\in \Bbb{N}$ exists $h_n\in H$ such that $h\cdot h_n\in H_n$ and $h_n\cdot h\in H_n$. If …
- 2,232