Timeline for Insolvable number fields ramified only at one (small) prime
Current License: CC BY-SA 3.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Oct 11, 2012 at 14:32 | comment | added | Chandan Singh Dalawat | For the record, the case $p=5$ is treated in arxiv.org/abs/0906.4374, and the case $p=7$ in arxiv.org/abs/1005.4209 (as I learnt from this answer by Kevin Ventullo: mathoverflow.net/questions/109298/…). | |
Oct 18, 2011 at 7:11 | history | edited | Chandan Singh Dalawat | CC BY-SA 3.0 |
edited body
|
Oct 18, 2011 at 6:59 | history | edited | Chandan Singh Dalawat | CC BY-SA 3.0 |
Dembele ---> Dembélé
|
Oct 18, 2011 at 6:58 | comment | added | François Brunault | The case $p=3$ seems also to be done in warwick.ac.uk/staff/L.Dembele/papers/nonsolvabe-dgv-033110.pdf | |
Oct 18, 2011 at 6:57 | vote | accept | Chandan Singh Dalawat | ||
Oct 18, 2011 at 6:56 | comment | added | Chandan Singh Dalawat | Many thanks. The paper in question is warwick.ac.uk/staff/L.Dembele/papers/nonsolvable.pdf, with and appendix warwick.ac.uk/staff/L.Dembele/papers/serre_complement.pdf by Serre. | |
Oct 18, 2011 at 6:54 | comment | added | Kevin Buzzard | So it is "recent progress in the Langlands programme" in the following sense. The key theoretical result is Carayol's theorem from 1986 beefed up by Blasius-Rogawski and Taylor in 1991 or so, attaching Galois representations to Hilbert modular forms. The recent progress is in our ability to compute examples of such things on a computer. | |
Oct 18, 2011 at 6:53 | history | edited | Kevin Buzzard | CC BY-SA 3.0 |
typo
|
Oct 18, 2011 at 6:45 | history | answered | Kevin Buzzard | CC BY-SA 3.0 |