Timeline for Associativity may fail by little?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 22, 2020 at 1:07 | history | became hot network question | |||
| Jan 22, 2020 at 1:02 | vote | accept | Luis Ferroni | ||
| Jan 21, 2020 at 20:42 | answer | added | James | timeline score: 15 | |
| Jan 21, 2020 at 17:45 | comment | added | Emil Jeřábek | Concerning randomized algorithms to test associativity, the basic idea of the Rajagopalan–Schulman algorithm is outlined in rjlipton.wordpress.com/2010/06/03/… | |
| Jan 21, 2020 at 17:42 | comment | added | Emil Jeřábek | math.stackexchange.com/a/2860039 | |
| Jan 21, 2020 at 17:14 | comment | added | Gerhard Paseman | Suppose you show it true for small almost semi group S. Then let S' have S as a proper substructure, let z in S' and z not in S, and declare x*y be z for x and y with at least one outside of S. Then S' fails associativity at exactly the same spot as does S. So you just need one example on three elements for S, or even on two elements if such exists. Gerhard "Small Failures Are Easily Propagated" Paseman, 2020.01.21. | |
| Jan 21, 2020 at 16:58 | comment | added | LSpice | Related: mathoverflow.net/questions/311209/… , and the answer mathoverflow.net/a/311213 . | |
| Jan 21, 2020 at 16:55 | history | asked | Luis Ferroni | CC BY-SA 4.0 |