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 147609
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.
6
votes
1
answer
128
views
Ascending sequences of idempotents in inverse semigroups
I've enocuntered the following question in my current research, and I'd appreciate any help you could give me. This is probably well known to experts on the subject.
Let $S = \langle K \rangle$ be a …
- 733
3
votes
1
answer
121
views
Quasi-isometries and E-unitary inverse semigroups
Let $S = \langle K\rangle$ be a finitely generated inverse semigroup, where $K \subset S$ is a fixed, finite and symmetric set of generators.
Preliminaries: Recall that we say that $s, t \in S$ are $ …
- 733