Timeline for Is there any nontrivial monad on the category of graphs?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Aug 17, 2017 at 14:59 | history | suggested | Martin Sleziak |
added (monads) tag
|
|
| Aug 17, 2017 at 14:35 | review | Suggested edits | |||
| S Aug 17, 2017 at 14:59 | |||||
| Apr 18, 2013 at 12:34 | answer | added | Andrej Bauer | timeline score: 4 | |
| Apr 18, 2013 at 12:26 | vote | accept | Gejza Jenča | ||
| Apr 18, 2013 at 12:17 | answer | added | Todd Trimble | timeline score: 6 | |
| Apr 18, 2013 at 12:07 | comment | added | Gejza Jenča | A trivial monad for a category $C$ is the one that arises from the adjoint pair of functors $(1_C,1_C)$. I do not understand what you mean by your second question. | |
| Apr 18, 2013 at 11:58 | comment | added | David White | And what do you mean by a nontrivial monad? Wouldn't operads be a source of examples? | |
| Apr 18, 2013 at 11:49 | history | asked | Gejza Jenča | CC BY-SA 3.0 |