Timeline for Is the number of representations as the sum of two elements of a polynomial sequence always small?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 7, 2016 at 7:55 | comment | added | Terry Tao | The answer at mathoverflow.net/questions/105304/… seems relevant here. | |
| Mar 6, 2016 at 23:54 | comment | added | Mark Lewko | I'm not sure. I thought about that briefly but didn't get too far. This quickly leads to questions outside of my expertise. | |
| Mar 6, 2016 at 23:48 | comment | added | Brandon Hanson | Do you know when $f(x)+f(y)$ is absolutely irreducible? It's tempting to try and repeat the argument in a number field. | |
| Mar 6, 2016 at 23:38 | comment | added | Mark Lewko | I had also observed this after posting the question. It certainly seems that this can't be generalized in any straightforward way to sums since there are polynomials such that f(x)+f(y) does not have linear factors. | |
| Mar 6, 2016 at 23:09 | review | First posts | |||
| Mar 6, 2016 at 23:12 | |||||
| Mar 6, 2016 at 23:06 | history | answered | Brandon Hanson | CC BY-SA 3.0 |