Timeline for Shimura-Taniyama-Weil VS Grothendieck's dessins
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 30, 2012 at 19:26 | history | edited | Will Sawin | CC BY-SA 3.0 |
edited body
|
| May 11, 2012 at 18:32 | comment | added | Will Sawin | I am not sure if I currently have a good example of an infinite family of daseins over $\mathbb Q$. I neglected to check something. | |
| May 11, 2012 at 18:25 | comment | added | Will Sawin | 1 might be a problem, I don't really know. All I claimed is that there are necessary and sufficient conditions. One can, for instance, construct infinite families of daseins that are defined over Q. 2 is not a problem, yes. I'm not sure if 3 can even be expressed in any kind of reasonable-sounding combinatorial terms. There is certainly at least one example: $X_0(11)$ is an elliptic curve, so its dasein is the dasein of an elliptic curve. | |
| May 11, 2012 at 12:44 | comment | added | Abdelmalek Abdesselam | @Will: thanks for the answer. It sounds more encouraging than I expected. If I understand you correctly 1) and 2) are not a problem, the difficulty is all in 3), right? Can the latter be formulated in a purely combinatorial way (i.e. using the kind of things published in journals with "combinatorics" in the name), even though such combinatorial problem might be "extremely hard in general"? Also, my question was not so much about the general case (that would be way too optimistic), but about examples. Has a combinatorial construction of covers for some examples of 3) been done? | |
| May 11, 2012 at 2:14 | history | answered | Will Sawin | CC BY-SA 3.0 |