Timeline for Expressing power sum symmetric polynomials in terms of lower degree power sums
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 27, 2010 at 15:54 | comment | added | Peter Erskin | Thank you, Robin! Your formula relates $ p_k $ to lower degree power sums including $ p_m $ with $ m>N, $ right? However, I wanted to express $ p_k $ entirely through $ p_1,...,p_N. $ This is formally done in the next answer by Gjergji Zaimi, as well as in the "Note Added" above (probably, the original formulation of my question was not particularly clear, sorry). Nevertheless, I think your contribution to the discussion is really very important. Thanks. | |
| Aug 26, 2010 at 18:17 | comment | added | Robin Chapman | Darij, I am assuming $p_0=N$ but for negative $u$ one still needs $p_u=\sum x_j^u$. | |
| Aug 26, 2010 at 18:15 | history | edited | Robin Chapman | CC BY-SA 2.5 |
added additional content
|
| Aug 26, 2010 at 18:00 | comment | added | darij grinberg | I mean, you can define $p_u$ for negative $u$ by $p_u=0$, and $p_0=n$. | |
| Aug 26, 2010 at 17:59 | comment | added | darij grinberg | I have fixed some obvious typos, but are you sure about requiring $k\geq 2N$? | |
| Aug 26, 2010 at 17:58 | history | edited | darij grinberg | CC BY-SA 2.5 |
typos fixed
|
| Aug 26, 2010 at 16:41 | history | answered | Robin Chapman | CC BY-SA 2.5 |