
// Make newform 300.4.d.d in Magma, downloaded from the LMFDB on 25 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_300_d();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_300_d_Hecke();"
// To make the coeffs of the qexp of the newform in the Hecke field type "qexpCoeffs();"
// To make the newform (type ModFrm), type "MakeNewformModFrm_300_4_d_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_300_4_d_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 := [1, 0, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rfbasis := [Kf.1^i : i in [0..Degree(Kf)-1]];
    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_300_d();"
function MakeCharacter_300_d()
    N := 300;
    order := 2;
    char_gens := [151, 101, 277];
    v := [2, 2, 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;

// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_300_d_Hecke();"
function MakeCharacter_300_d_Hecke(Kf)
    N := 300;
    order := 2;
    char_gens := [151, 101, 277];
    char_values := [[1, 0], [1, 0], [-1, 0]];
    assert UnitGenerators(DirichletGroup(N)) eq char_gens;
    values := ConvertToHeckeField(char_values : pass_field := true, Kf := Kf); // the value of chi on the gens as elements in the Hecke field
    F := Universe(values);// the Hecke field
    chi := DirichletCharacterFromValuesOnUnitGenerators(DirichletGroup(N,F),values);
    return chi;
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+1)]];
    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 := 4;
    raw_aps := [[0, 0], [0, 3], [0, 0], [0, 32], [36, 0], [0, 10], [0, -78], [-140, 0], [0, 192], [-6, 0], [-16, 0], [0, -34], [-390, 0], [0, 52], [0, 408], [0, 114], [-516, 0], [-58, 0], [0, -892], [-120, 0], [0, 646], [1168, 0], [0, 732], [1590, 0], [0, 194], [798, 0], [0, -272], [0, 156], [-1622, 0], [0, -1074], [0, -1528], [2412, 0], [0, 2106], [556, 0], [2418, 0], [2840, 0], [0, 2054], [0, 460], [0, 2016], [0, 618], [2964, 0], [-370, 0], [1104, 0], [0, 2398], [0, 1278], [-4472, 0], [1340, 0], [0, -2360], [0, 1380], [-1694, 0], [0, 5190], [-2352, 0], [-3502, 0], [4788, 0], [0, 1506], [0, 432], [-54, 0], [-6496, 0], [0, -466], [-4854, 0], [0, 4516], [0, -8574], [0, 3476], [2424, 0], [0, 1558], [0, -8538], [-988, 0], [0, 2546], [0, 8556], [3706, 0], [0, -11394], [264, 0], [0, 10232], [0, 562], [7228, 0], [0, 5736], [9186, 0], [0, -394], [-1614, 0], [-1034, 0], [-3708, 0], [-4930, 0], [-2592, 0], [0, -2162], [-1352, 0], [0, -5532], [3198, 0], [0, -1510], [16086, 0], [0, -5384], [0, -2604], [-11136, 0], [0, 14624], [11844, 0], [11284, 0], [0, -4032], [17562, 0], [3162, 0], [0, -6764], [17798, 0], [0, -19996], [0, 11094], [0, -900], [-7914, 0], [-2380, 0], [0, -25726], [0, 3612], [0, -2898], [-2664, 0], [-502, 0], [0, 7976], [0, -20414], [0, -6342], [-22676, 0], [-7048, 0], [-20286, 0], [0, 16108], [0, 27456], [0, 12522], [16308, 0], [32078, 0], [0, -4610], [0, 10782], [0, -2892], [-29572, 0], [5766, 0], [-3326, 0], [7728, 0], [0, -21616], [0, -10118], [-10460, 0], [0, -17232], [26912, 0], [0, 13838], [-17238, 0], [-21698, 0], [0, -18366], [0, -30316], [0, 7494], [11526, 0], [-33820, 0], [19566, 0], [0, 40096], [0, 31884], [24442, 0], [31944, 0], [0, -17486], [0, 43434], [-10820, 0], [0, -29976], [0, -40522], [15570, 0], [0, 1084], [0, -8208], [0, 34076], [-15072, 0], [-24392, 0], [-13602, 0], [0, -47974], [-48330, 0], [0, -9324], [0, 14838], [0, 11360], [-6972, 0], [0, -41166], [0, -22464], [-10192, 0], [0, -322]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_300_d_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_300_4_d_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_300_4_d_d(:prec:=2)
    chi := MakeCharacter_300_d();
    f_vec := qexpCoeffs();
    Kf := Universe(f_vec);
    // SetVerbose("ModularForms", true);
    // SetVerbose("ModularSymbols", true);
    S := CuspidalSubspace(ModularForms(chi, 4));
    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_300_4_d_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_300_4_d_d( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_300_d();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,4,sign)));
    Vf := Kernel([<7,R![1024, 0, 1]>],Snew);
    return Vf;
end function;