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 120504
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.
1
vote
0
answers
192
views
What is the normalized complex of a simplicial set with a monoid action?
This question is a follow up to this question I posted on Math.SE. I will make this question self-contained, though.
In a certain point on the paper The Geometry of Rewriting Systems, Kenneth Brown d …
1
vote
0
answers
68
views
How exactly to adapt Brown's collapse from monoids to algebras?
In The Geometry of Rewriting Systems (Springerlink behind paywall), Kenneth Brown describes a method to collapse the bar resolution of a monoid. Roughly:
Given a simplicial set $X$ equipped with a c …