Timeline for Does any cubic polynomial become reducible through composition with some quadratic?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 17, 2021 at 20:14 | comment | added | Yaakov Baruch | @GregMartin: Great, interesting article! Thank you. | |
| Jul 16, 2021 at 19:15 | comment | added | Greg Martin | See also my paper with Bober, Fretwell, and Wooley, Theorem 3.2, to see that there are infinitely many such quadratic polynomials $G(x)$. (The method is certainly based on that of Schinzel.) For those with a background in abstract algebra, I believe our proof has more intuition behind it. | |
| Jul 16, 2021 at 15:49 | comment | added | Hanno | @Hhhhhhhhhhh You may compactify the scrolling altogether by choosing the syntax matwbn.icm.edu.pl/ksiazki/aa/aa13/aa13113.pdf#page=29 $\;\ddot\smile$ | |
| Jul 16, 2021 at 14:40 | vote | accept | Yaakov Baruch | ||
| Jul 16, 2021 at 14:40 | comment | added | Yaakov Baruch | The integrality of coefficients is achieved there by a suitable choice of some $k$; I'm not sure, but it seems to me that $k$ could be a chosen to be a rational function of the coefficients (maybe a very messy one, using sums of squares of many things to avoid using the max function), in which case the resulting $H$ (our $Q$) would be given by one formula in the coefficients. | |
| Jul 16, 2021 at 14:24 | history | edited | Hhhhhhhhhhh | CC BY-SA 4.0 |
added 10 characters in body
|
| Jul 16, 2021 at 14:23 | comment | added | Hhhhhhhhhhh | Sorry @Yaakov Baruch I should have added page number. I will add right now. | |
| Jul 16, 2021 at 14:21 | comment | added | Yaakov Baruch | @AlexB. Indeed... I wish I saw your comment earlier! | |
| Jul 16, 2021 at 12:13 | history | edited | Hhhhhhhhhhh | CC BY-SA 4.0 |
edited body
|
| Jul 16, 2021 at 12:02 | comment | added | Alex B. | To save others the scrolling: Lemma 10 is on page 233 of the paper. | |
| Jul 16, 2021 at 11:53 | history | answered | Hhhhhhhhhhh | CC BY-SA 4.0 |