Timeline for Is there an algorithm to compute efficiently the dessin d'enfant from a Belyi pair?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2013 at 19:19 | comment | added | Dima Sustretov | this looks like a natural idea indeed. I am not sure I have the right intuition about this, but does this approach actually guarantee decidability of the problem I have inquired abut? it might be the case that using approximate solutions leads to accumulation of error and would lead to producing an incorrect solution. of course, in practice this might be not relevant, perhaps the current computers can only process very small problems, and so no errors cropping up will happen | |
| Nov 5, 2013 at 18:56 | history | answered | David E Speyer | CC BY-SA 3.0 |