Timeline for Finding a compatible multiplication for a given group
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 5, 2017 at 21:19 | vote | accept | FusRoDah | ||
| Sep 5, 2017 at 13:45 | vote | accept | FusRoDah | ||
| Sep 5, 2017 at 13:45 | |||||
| Sep 5, 2017 at 13:45 | vote | accept | FusRoDah | ||
| Sep 5, 2017 at 13:45 | |||||
| Sep 5, 2017 at 6:55 | answer | added | Keith Kearnes | timeline score: 2 | |
| Sep 4, 2017 at 18:11 | answer | added | Pace Nielsen | timeline score: 4 | |
| Sep 4, 2017 at 16:56 | history | edited | YCor |
edited tags
|
|
| Sep 4, 2017 at 16:42 | comment | added | Todd Trimble | As for the question Tom raises, there is some useful commentary here: math.stackexchange.com/a/432853/43208 Of course, if one is speaking about semigroups as opposed to monoids (i.e., unital rings), there is always the trivial choice where all products are zero. | |
| S Sep 4, 2017 at 16:24 | history | suggested | Ali Taghavi |
I add a tag
|
|
| Sep 4, 2017 at 16:17 | review | Suggested edits | |||
| S Sep 4, 2017 at 16:24 | |||||
| Sep 4, 2017 at 13:23 | comment | added | Tom De Medts | Is it known whether there is some algorithm telling you whether there is a ring $(G, +, \times)$ for the given abelian group $(G, +)$? My guess is that already for this question, the answer is no; see also mathoverflow.net/questions/92557/…. (This doesn't answer your second question.) | |
| Sep 4, 2017 at 6:22 | review | First posts | |||
| Sep 4, 2017 at 7:42 | |||||
| Sep 4, 2017 at 6:18 | history | asked | FusRoDah | CC BY-SA 3.0 |