Timeline for roots of sum of two polynomials
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 29, 2021 at 17:58 | comment | added | yupbank | would $P_n(x) + AxP_n(x)$ makes the problem simpler ? | |
| Apr 13, 2016 at 9:32 | review | Suggested edits | |||
| Apr 13, 2016 at 9:43 | |||||
| Jul 2, 2010 at 9:02 | vote | accept | vilvarin | ||
| Jul 1, 2010 at 17:28 | comment | added | vilvarin | in my case $P_n$ and $Q_n$ are known rekursiv polynomials of degree $n$.Positive.A>0. So all roots are complex | |
| Jun 30, 2010 at 19:43 | comment | added | Helge | Highly non-trivial techniques to do this were developed by Goldstein and Schlag in math.uchicago.edu/~schlag/papers/gaps.pdf and math.uchicago.edu/~schlag/papers/equi.pdf . They had quite a specific problem in mind, so this might not be too helpful for you. The buzzword there is "Jensen formula". | |
| Jun 30, 2010 at 18:13 | answer | added | SandeepJ | timeline score: 9 | |
| Jun 30, 2010 at 17:01 | answer | added | j.c. | timeline score: 8 | |
| Jun 30, 2010 at 16:43 | comment | added | Andrey Rekalo | What is assumed about $P_n$, $Q_n$ and their roots? | |
| Jun 30, 2010 at 16:32 | history | asked | vilvarin | CC BY-SA 2.5 |