Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with langlands-conjectures
Search options not deleted
user 5267
Higher reciprocity laws
4
votes
Open project: Let's compute the Fourier expansion of a non-solvable algebraic Maass form.
I will copy a comment of mine about Jehanne over here.
His paper is: http://dx.doi.org/10.1006/jnth.2001.2656
Jehanne has 4 totally real Examples 2-5 (page 353-6), including the one of Booker. He al …
- 2,704
5
votes
Open project: Let's compute the Fourier expansion of a non-solvable algebraic Maass form.
Hmm, a problem. In 4 hours Magma can compute this:
> f:=x^24 - 50726*x^22 + 152929135*x^20 - 158664037068*x^18 + 63787035668165*x^16 -
9040633522810414*x^14 + 287094814384960835*x^12 - 205003861 …
- 2,704
3
votes
Open project: Let's compute the Fourier expansion of a non-solvable algebraic Maass form.
Actually, I should read the help with Magma, for the direction to ArtinRepresentations is there.
f:=14488688572801 - 2922378139308818*x^2 + 134981448876235615*x^4 -
1381768039105642956*x^6 + 4 …
- 2,704
3
votes
Open project: Let's compute the Fourier expansion of a non-solvable algebraic Maass form.
I got it to work!
First the preliminary data:
_<x> := PolynomialRing(Rationals());
f5 :=344 + 3106*x - 1795*x^2 - 780*x^3 - x^4 + x^5; …
- 2,704
27
votes
Accepted
Open project: Let's compute the Fourier expansion of a non-solvable algebraic Maass form.
Here is Magma code that gets you the answer in a few seconds. I made a special case for the bad primes, and did them by hand.
_<x> := PolynomialRing(Rationals());
f5 := 344 + 3106*x - 1795*x^2 - 780* …
- 2,704