Timeline for Parseval type lower bound on sum of squares of function projections
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 9, 2020 at 9:58 | history | edited | YCor | CC BY-SA 4.0 |
removed capitals from title, added tag
|
| Jun 9, 2020 at 8:56 | history | edited | kodlu | CC BY-SA 4.0 |
focused question and improved formatting
|
| Sep 21, 2019 at 6:31 | history | edited | kodlu | CC BY-SA 4.0 |
narrowed the focus of the question
|
| Jul 15, 2019 at 14:12 | comment | added | kodlu | @fedja gentle reminder | |
| Jun 22, 2019 at 12:52 | comment | added | kodlu | @fedja please see new edit | |
| Jun 22, 2019 at 0:22 | history | edited | kodlu | CC BY-SA 4.0 |
added 101 characters in body
|
| Jun 21, 2019 at 3:42 | comment | added | kodlu | @fedja now I see. Thanks. I will update with a meaningful constraint, when I have time to think carefully. | |
| Jun 21, 2019 at 0:44 | comment | added | fedja | The new condition is not scale-invariant and, thereby meaningless. Just perturb all values in my example by $c$ where $c$ is extremely small. | |
| Jun 21, 2019 at 0:38 | comment | added | kodlu | @fedja, please see edit. | |
| Jun 21, 2019 at 0:38 | history | edited | kodlu | CC BY-SA 4.0 |
clarified condition in the problem
|
| Jun 21, 2019 at 0:34 | comment | added | fedja | What prevents all sums on the left from being $0$? I mean, $N=m!$, $f(n)=e^{2\pi i n/N}$, say. | |
| Jun 20, 2019 at 23:34 | history | asked | kodlu | CC BY-SA 4.0 |