Timeline for Is there an algorithm to compute efficiently the dessin d'enfant from a Belyi pair?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 26, 2014 at 12:01 | vote | accept | Dima Sustretov | ||
| Nov 13, 2013 at 21:13 | answer | added | Alexandre Eremenko | timeline score: 5 | |
| Nov 5, 2013 at 19:27 | history | edited | Dima Sustretov |
edited tags
|
|
| Nov 5, 2013 at 18:56 | answer | added | David E Speyer | timeline score: 3 | |
| Nov 5, 2013 at 17:13 | history | edited | Dima Sustretov | CC BY-SA 3.0 |
added 24 characters in body
|
| Nov 5, 2013 at 11:56 | history | edited | Dima Sustretov | CC BY-SA 3.0 |
added 609 characters in body
|
| Nov 5, 2013 at 11:25 | comment | added | Dima Sustretov | Dear j.c., thanks for the reference, however, I am interested in the "opposite direction" computation, i.e. getting a dessin d'enfant from a covering, which ought to be easier than getting a Belyi function from a dessin d'enfant, a problem which is open even in its non-efficient version, if I am not mistaken. | |
| Nov 5, 2013 at 11:15 | comment | added | j.c. | There is a reference in the comments of this question mathoverflow.net/questions/38274/… to math.u-bordeaux1.fr/~jcouveig/publi/volk.pdf | |
| Nov 5, 2013 at 10:21 | history | edited | Dima Sustretov | CC BY-SA 3.0 |
added 4 characters in body
|
| Nov 5, 2013 at 9:04 | history | asked | Dima Sustretov | CC BY-SA 3.0 |