
// Make newform 503.2.a.d in Magma, downloaded from the LMFDB on 07 June 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_503_a();"
// To make the coeffs of the qexp of the newform in the Hecke field type "qexpCoeffs();"
// To make the newform (type ModFrm), type "MakeNewformModFrm_503_2_a_d();".
// This may take a long time!  To see verbose output, uncomment the SetVerbose lines below.
// The precision argument determines an initial guess on how many Fourier coefficients to use.
// This guess is increased enough to uniquely determine the newform.
// To make the Hecke irreducible modular symbols subspace (type ModSym)
// containing the newform, type "MakeNewformModSym_503_2_a_d();".
// This may take a long time!  To see verbose output, uncomment the SetVerbose line below.
// The default sign is -1.  You can change this with the optional parameter "sign".
function ConvertToHeckeField(input: pass_field := false, Kf := [])
    if not pass_field then
        poly := [3, -4, -1, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0], [0, 1, 0], [-3, 0, 1]];
    Rf_basisdens := [1, 1, 1];
    Rf_basisnums := ChangeUniverse([[z : z in elt] : elt in Rf_num], Kf);
    Rfbasis := [Rf_basisnums[i]/Rf_basisdens[i] : i in [1..Degree(Kf)]];
    inp_vec := Vector(Rfbasis)*ChangeRing(Transpose(Matrix([[elt : elt in row] : row in input])),Kf);
    return Eltseq(inp_vec);
end function;


// To make the character of type GrpDrchElt, type "MakeCharacter_503_a();"
function MakeCharacter_503_a()
    N := 503;
    order := 1;
    char_gens := [5];
    v := [1];
    // chi(gens[i]) = zeta^v[i]
    assert UnitGenerators(DirichletGroup(N)) eq char_gens;
    F := CyclotomicField(order);
    chi := DirichletCharacterFromValuesOnUnitGenerators(DirichletGroup(N,F),[F|F.1^e:e in v]);
    return MinimalBaseRingCharacter(chi);
end function;

function MakeCharacter_503_a_Hecke(Kf)
    return MakeCharacter_503_a();
end function;


function ExtendMultiplicatively(weight, aps, character)
    prec := NextPrime(NthPrime(#aps)) - 1; // we will able to figure out a_0 ... a_prec
    primes := PrimesUpTo(prec);
    prime_powers := primes;
    assert #primes eq #aps;
    log_prec := Floor(Log(prec)/Log(2)); // prec < 2^(log_prec+1)
    F := Universe(aps);
    FXY<X, Y> := PolynomialRing(F, 2);
    // 1/(1 - a_p T + p^(weight - 1) * char(p) T^2) = 1 + a_p T + a_{p^2} T^2 + ...
    R<T> := PowerSeriesRing(FXY : Precision := log_prec + 1);
    recursion := Coefficients(1/(1 - X*T + Y*T^2));
    coeffs := [F!0: i in [1..prec]];
    coeffs[1] := 1; //a_1
    for i := 1 to #primes do
        p := primes[i];
        coeffs[p] := aps[i];
        b := p^(weight - 1) * F!character(p);
        r := 2;
        p_power := p * p;
        //deals with powers of p
        while p_power le prec do
            Append(~prime_powers, p_power);
            coeffs[p_power] := Evaluate(recursion[r + 1], [aps[i], b]);
            p_power *:= p;
            r +:= 1;
        end while;    
    end for;
    Sort(~prime_powers);
    for pp in prime_powers do
        for k := 1 to Floor(prec/pp) do
            if GCD(k, pp) eq 1 then
                coeffs[pp*k] := coeffs[pp]*coeffs[k];
            end if;
        end for;
    end for;
    return coeffs;
end function;


function qexpCoeffs()
    // To make the coeffs of the qexp of the newform in the Hecke field type "qexpCoeffs();"
    weight := 2;
    raw_aps := [[0, 0, 1], [0, 1, 0], [0, 0, 0], [0, 1, -1], [4, -1, 0], [2, -1, -1], [4, 0, 2], [4, 0, 0], [-4, 0, 0], [0, -2, -2], [-4, 2, -2], [2, -4, 0], [0, 2, 4], [1, 2, -3], [7, -2, -1], [6, -4, -2], [-1, -2, -1], [2, 0, 0], [11, 2, -1], [4, 0, -2], [12, -1, 2], [-4, 5, 3], [0, -1, 1], [0, 4, 2], [-6, -5, 3], [-8, 4, -2], [-2, 8, -4], [-4, 4, 0], [4, 2, 6], [3, -8, 3], [6, -2, 8], [-1, -2, 3], [12, 0, 2], [4, -8, 0], [6, 0, -2], [-2, -10, 4], [4, 2, 2], [-4, 2, 0], [-6, 4, 0], [0, 7, -6], [-16, -2, 2], [6, -4, -6], [-8, 2, 4], [12, -4, -6], [-2, -8, 4], [4, 7, 4], [-10, 4, 2], [-16, 3, 0], [2, -4, -4], [1, 0, 9], [0, -5, -6], [-10, -2, 4], [0, 4, -2], [0, 0, -4], [-2, 9, 5], [0, -1, -7], [-6, 8, -4], [-3, -6, 9], [4, 0, 4], [-2, 4, 8], [-1, -2, 3], [-1, 0, -1], [-4, -10, 6], [18, 2, -6], [-14, 4, -6], [-19, 4, -3], [6, 0, 4], [10, -4, 14], [-10, 8, 0], [-8, -6, 4], [-6, 0, -2], [-6, -6, 4], [-8, 5, -4], [16, -3, 6], [24, -1, 5], [-15, 2, -15], [-10, 1, -3], [3, 4, 11], [18, -9, -5], [10, 6, -10], [2, -12, 6], [23, -4, -1], [-6, -10, -6], [-3, 12, -11], [6, 2, -8], [-12, -11, -1], [-12, 6, 0], [10, 4, -8], [-14, -2, 2], [8, 8, 4], [6, -6, 0], [-16, -6, -2], [-28, 0, -8], [6, 14, -6], [-2, -4, -12], [1, 0, 0], [8, 13, -10], [-14, 1, 5], [-6, -4, 12], [-4, 4, 8], [-3, -10, -7], [12, -11, 2], [8, -12, -2], [32, -3, 6], [0, 10, -2], [-16, 8, 6], [8, -9, -8], [-16, 2, 4], [-12, 11, 1], [11, 8, -5], [-32, -5, 5], [-2, 6, 18], [-28, 4, 8], [-2, 4, 10], [-5, -10, -1], [19, 0, -5], [14, -16, 6], [0, 8, 16], [-6, 19, -9], [-12, 5, -17], [-6, -5, 15], [11, -12, -13], [-24, 8, -2], [20, -10, -8], [-8, -7, -1], [12, -11, -2], [-6, -10, 2], [-12, -1, 12], [16, -3, -4], [10, 12, -2], [-16, 9, 0], [-4, -12, -4], [-4, 4, -10], [20, 10, 6], [-16, 19, -2], [-6, 4, -8], [-2, -4, 4], [-20, -10, 4], [-4, 13, 2], [-8, -6, 6], [-4, -8, -8], [-24, -10, 4], [-20, 16, 14], [20, 8, -4], [-6, 0, -8], [32, 7, -3], [-2, -1, -1], [16, 9, 6], [-18, 12, 2], [-18, -16, 8], [4, 20, -2], [7, -4, -9], [16, 15, -8], [-9, -18, 15], [28, -4, -8], [18, 2, 12], [8, 7, -3], [-18, 0, 4], [-2, 12, 2], [18, -5, -1], [16, 8, -2], [23, -4, 7], [-20, -10, -6], [-32, 4, -4], [5, -4, -23], [4, 2, -10], [12, 1, 4], [12, -20, -12]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_503_a_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_503_2_a_d();".
// This may take a long time!  To see verbose output, uncomment the SetVerbose lines below.
// The precision argument determines an initial guess on how many Fourier coefficients to use.
// This guess is increased enough to uniquely determine the newform.
function MakeNewformModFrm_503_2_a_d(:prec:=3)
    chi := MakeCharacter_503_a();
    f_vec := qexpCoeffs();
    Kf := Universe(f_vec);
    // SetVerbose("ModularForms", true);
    // SetVerbose("ModularSymbols", true);
    S := CuspidalSubspace(ModularForms(chi, 2));
    S := BaseChange(S, Kf);
    maxprec := NextPrime(997) - 1;
    while true do
        trunc_vec := Vector(Kf, [0] cat [f_vec[i]: i in [1..prec]]);
        B := Basis(S, prec + 1);
        S_basismat := Matrix([AbsEltseq(g): g in B]);
        if Rank(S_basismat) eq Min(NumberOfRows(S_basismat), NumberOfColumns(S_basismat)) then
            S_basismat := ChangeRing(S_basismat,Kf);
            f_lincom := Solution(S_basismat,trunc_vec);
            f := &+[f_lincom[i]*Basis(S)[i] : i in [1..#Basis(S)]];
            return f;
        end if;
        error if prec eq maxprec, "Unable to distinguish newform within newspace";
        prec := Min(Ceiling(1.25 * prec), maxprec);
    end while;
end function;


// To make the Hecke irreducible modular symbols subspace (type ModSym)
// containing the newform, type "MakeNewformModSym_503_2_a_d();".
// This may take a long time!  To see verbose output, uncomment the SetVerbose line below.
// The default sign is -1.  You can change this with the optional parameter "sign".
function MakeNewformModSym_503_2_a_d( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_503_a();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<2,R![3, -5, 0, 1]>,<3,R![3, -4, -1, 1]>],Snew);
    return Vf;
end function;