Timeline for FFT like theorems for tensor product
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 24, 2012 at 4:21 | comment | added | Will Sawin | One could break up into irreducible representations of $S_n$ and then try to answer for those. Is there a reason this might fail to give the best possible answer? | |
Mar 24, 2012 at 4:07 | comment | added | R Hahn | I thought this was going to be about fast Fourier transforms. | |
Mar 24, 2012 at 3:58 | history | edited | mark | CC BY-SA 3.0 |
edited body
|
Mar 24, 2012 at 3:53 | comment | added | darij grinberg | +1 for the audacity to ask something as hopeless as this. | |
Mar 24, 2012 at 3:35 | history | asked | mark | CC BY-SA 3.0 |