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 152679
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.
3
votes
0
answers
88
views
Reference for the monoidal category structure $X \otimes Y = X + Y + X \times Y$ on a distri...
Given a distributive category $\mathscr C$ (more generally a rig category), we can define a (semicocartesian) monoidal category structure on $\mathscr C$ with tensor product given by $X \otimes Y := X …
- 10.7k
3
votes
Accepted
"Tietze-like transformations" for defining interesting bijections between algebraic structures
Tietze transformations for arbitrary algebraic theories (with respect to their presentations) have been considered in Malbos–Mimram's Homological Computations for Term Rewriting Systems, in the contex …
- 10.7k