Timeline for Computing Slim Extensions representing Ext
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 26, 2012 at 7:05 | comment | added | Joseph Victor | Thanks Ralph. In the case of group cohomology, in playing around I was able to make $\mathcal{X}$ much smaller than the bar resolution, which obviously is not minimal. However, I was hoping to make \mathcal{X} smaller than the resolution being used even if that resolution was itself minimal (in the sense of the algorithm from the last paragraph). Is this something that can be done? | |
| Nov 25, 2012 at 23:45 | history | answered | Ralph | CC BY-SA 3.0 |