Timeline for Real polynomial bounded at inverse-integer points
Current License: CC BY-SA 4.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 7, 2018 at 3:27 | vote | accept | Scott Aaronson | ||
Jun 6, 2018 at 19:05 | answer | added | fedja | timeline score: 20 | |
Jun 6, 2018 at 18:56 | comment | added | fedja | I think I can do it (both bounds). I'll try to post when I have time (unless somebody else figures it out faster) | |
Jun 6, 2018 at 5:17 | comment | added | Scott Aaronson | I also did a back-of-the-envelope calculation last night that led me to wonder whether $N^{1/3}$ was the right answer -- but I could prove it neither as an upper bound nor as a lower bound. | |
Jun 6, 2018 at 3:25 | comment | added | fedja | $N^{1/3}$ seems to be the right answer (up to a constant factor, of course), but that is just a back of envelope computation with no warranty attached to it. | |
Jun 5, 2018 at 20:22 | comment | added | Scott Aaronson | Yes, I was able to access some by proxy server. Others my university library did not have. In any case, I prefer to link to stuff that anyone reading my question can see. In that spirit, the following paper by Nisan and Szegedy has a nice self-contained proof of the "Ehlich-Zeller-Rivlin-Cheney theorem": hebuntu.cs.huji.ac.il/~noam/degree.ps It also, of course, has the bibliographic references. | |
Jun 5, 2018 at 20:11 | comment | added | Igor Rivin | I don't understand the "paywalled" comment. Surely your university subscribes?! | |
Jun 5, 2018 at 20:11 | history | edited | Scott Aaronson | CC BY-SA 4.0 |
added 28 characters in body
|
Jun 5, 2018 at 20:10 | comment | added | Scott Aaronson | Yes, that's what I meant (edited to clarify). | |
Jun 5, 2018 at 20:02 | history | asked | Scott Aaronson | CC BY-SA 4.0 |