Timeline for Can we find an l-2 sequence if we know all l-p norms?
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 10, 2010 at 16:59 | answer | added | MarkV | timeline score: 1 | |
| Mar 9, 2010 at 18:14 | history | edited | MarkV | CC BY-SA 2.5 |
assume non-increasing
|
| Mar 9, 2010 at 18:13 | comment | added | MarkV | of course you're right - I should require that c_n be monotone. I'll look into your suggestion, thank you. | |
| Mar 9, 2010 at 18:07 | comment | added | David Loeffler | You're going to struggle to recover individual terms of the sequence, since re-ordering the sequence doesn't change any of the l_p norms. You might have better luck approximating the function C(x) = (number of n such that |c_n| > x); you're essentially trying to recover C(x) from its Mellin transform. | |
| Mar 9, 2010 at 18:06 | history | edited | MarkV | CC BY-SA 2.5 |
forgot ^p on c norms
|
| Mar 9, 2010 at 17:57 | history | asked | MarkV | CC BY-SA 2.5 |