Timeline for Asymptotics of Fourier coefficients of power-type functions
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2011 at 12:46 | vote | accept | Eric | ||
| Dec 14, 2011 at 22:28 | answer | added | fedja | timeline score: 5 | |
| Dec 14, 2011 at 16:08 | comment | added | Antoine Levitt | There's a lot of sites like that, usually used for pasting code. I didn't actually know about mathurl, it's pretty neat! | |
| Dec 14, 2011 at 16:04 | comment | added | Igor Rivin | @Antoine I am amused that pastein.com is just like mathurl... | |
| Dec 14, 2011 at 16:02 | comment | added | Antoine Levitt | Actually, this asymptotic behaviour is quite easy to prove using a simple change of variable. It doesn't give the full asymptotics and constants though, see Igor Rivin's answer below for that. | |
| Dec 14, 2011 at 15:53 | answer | added | Igor Rivin | timeline score: 1 | |
| Dec 14, 2011 at 15:50 | comment | added | Antoine Levitt | Just did some crude numerics on that for fun, result is that $\hat f(n) \approx n^{-(1 - alpha)}$. Code (python/numpy) is at pastebin.com/rL5QNMnv if you want to take a look. I'm interested in the proof. | |
| Dec 14, 2011 at 12:34 | history | asked | Eric | CC BY-SA 3.0 |