Timeline for Advances and difficulties in effective version of Thue-Roth-Siegel Theorem
Current License: CC BY-SA 2.5
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 9, 2018 at 18:46 | answer | added | Angeliki Koutsoukou Argyraki | timeline score: 2 | |
| Feb 7, 2012 at 4:10 | history | edited | Charles |
tag
|
|
| Jul 3, 2011 at 2:35 | answer | added | Joe Silverman | timeline score: 15 | |
| Mar 24, 2011 at 3:43 | vote | accept | Stanley Yao Xiao | ||
| Mar 19, 2011 at 2:49 | comment | added | George Lowther | Well, Felipe's response answers my question. An effective Thue-Siegel-Roth theorem is implied by the abc conjecture. | |
| Mar 19, 2011 at 0:59 | answer | added | Felipe Voloch | timeline score: 10 | |
| Mar 18, 2011 at 23:47 | comment | added | George Lowther | Alternatively, similar to the case of the rank of an elliptic curve and the Birch and Swinnerton-Dyer conjecture, are there any conjectures which are generally believed to be true and would lead to an effective Thue-Siegel-Roth theorem? | |
| Mar 18, 2011 at 23:32 | comment | added | George Lowther | What about the converse? That is, for any fixed $r > 2$, consider the set $S$ of polynomials in $\mathbb{Z}[X]$ which have a real root $\alpha$ for which there exists a rational approximation $\vert\alpha -p/q\vert < q^{-r}$. Is it plausible that $S$ might not be computable? Maybe, even, it could be reduced to the Halting problem. Has this ever been considered? | |
| Mar 18, 2011 at 22:07 | answer | added | Boris Bukh | timeline score: 11 | |
| Mar 18, 2011 at 18:02 | answer | added | Denis Chaperon de Lauzières | timeline score: 22 | |
| Mar 18, 2011 at 17:27 | answer | added | Charles Matthews | timeline score: 9 | |
| Mar 18, 2011 at 17:02 | history | asked | Stanley Yao Xiao | CC BY-SA 2.5 |