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 ra.rings-and-algebras
Search options not deleted
user 120504
Non-commutative rings and algebras, non-associative algebras, universal algebra and lattice theory, linear algebra, semigroups. For questions specific to commutative algebra (that is, rings that are assumed both associative and commutative), rather use the tag ac.commutative-algebra.
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 …
- 63.9k