
// Make newform 300.4.d.e in Magma, downloaded from the LMFDB on 24 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_e();".
// 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_e();".
// 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, 8], [36, 0], [0, 10], [0, 18], [100, 0], [0, -72], [234, 0], [-16, 0], [0, -226], [90, 0], [0, -452], [0, 432], [0, -414], [684, 0], [422, 0], [0, 332], [-360, 0], [0, -26], [-512, 0], [0, 1188], [630, 0], [0, -1054], [558, 0], [0, -8], [0, 1764], [-1622, 0], [0, 1134], [0, -592], [-1908, 0], [0, 954], [-2564, 0], [738, 0], [-2440, 0], [0, -2554], [0, 820], [0, 1944], [0, 1242], [-1116, 0], [1070, 0], [-576, 0], [0, 1342], [0, 1422], [-872, 0], [1340, 0], [0, -4880], [0, 2700], [-254, 0], [0, -4410], [3888, 0], [5138, 0], [4788, 0], [0, -5886], [0, -2232], [666, 0], [-5536, 0], [0, 2126], [-2934, 0], [0, -2036], [0, -2286], [0, 1244], [1224, 0], [0, -1898], [0, -9162], [-4348, 0], [0, 7154], [0, -1836], [-5894, 0], [0, -11106], [-13176, 0], [0, -6112], [0, 13618], [-692, 0], [0, 8064], [-12654, 0], [0, -106], [-4014, 0], [-3914, 0], [-4428, 0], [-15490, 0], [6768, 0], [0, -1298], [2248, 0], [0, 9612], [-162, 0], [0, 1370], [-15354, 0], [0, 13024], [0, -14436], [-12096, 0], [0, 6056], [7524, 0], [-5276, 0], [0, -4968], [-10998, 0], [-8838, 0], [0, -22436], [-4762, 0], [0, -6004], [0, -5274], [0, 12420], [21366, 0], [21140, 0], [0, 3266], [0, 17028], [0, -9522], [10296, 0], [-3382, 0], [0, -20656], [0, 22114], [0, 19962], [604, 0], [152, 0], [4194, 0], [0, 7252], [0, -6696], [0, -28422], [19908, 0], [14318, 0], [0, -30050], [0, 22158], [0, 3132], [-20932, 0], [-21834, 0], [-12446, 0], [12528, 0], [0, 11576], [0, 29338], [-2540, 0], [0, 18792], [4832, 0], [0, -20818], [12042, 0], [-13058, 0], [0, 11826], [0, 11996], [0, 6966], [40806, 0], [-17980, 0], [-12834, 0], [0, 37864], [0, 42516], [-45638, 0], [-17496, 0], [0, -32174], [0, -38934], [-29780, 0], [0, 48096], [0, 21302], [-7470, 0], [0, -764], [0, 32328], [0, -36316], [-13392, 0], [-38072, 0], [12798, 0], [0, 34874], [17190, 0], [0, 40284], [0, -15498], [0, 37160], [18468, 0], [0, 10386], [0, -44136], [-28432, 0], [0, -39778]];
    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_e();".
// 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_e(: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_e();".
// 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_e( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_300_d();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,4,sign)));
    Vf := Kernel([<7,R![64, 0, 1]>],Snew);
    return Vf;
end function;