
// Make newform 300.3.g.d in Magma, downloaded from the LMFDB on 23 December 2025.
// To make the character of type GrpDrchElt, type "MakeCharacter_300_g();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_300_g_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_3_g_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_3_g_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 := [5, 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_g();"
function MakeCharacter_300_g()
    N := 300;
    order := 2;
    char_gens := [151, 101, 277];
    v := [2, 1, 2];
    // 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_g_Hecke();"
function MakeCharacter_300_g_Hecke( : Kf := false)
    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 := ISA(Type(Kf), Fld), 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]];
    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 := 3;
    raw_aps := [[0, 0], [-2, 1], [0, 0], [-2, 0], [0, 6], [-8, 0], [0, -6], [-34, 0], [0, -18], [0, -18], [14, 0], [-56, 0], [0, -12], [-8, 0], [0, 18], [0, 18], [0, 6], [-46, 0], [-32, 0], [0, 24], [106, 0], [-22, 0], [0, 54], [0, 48], [-122, 0], [0, -78], [46, 0], [0, -6], [86, 0], [0, -42], [34, 0], [0, 66], [0, 18], [-82, 0], [0, 66], [-46, 0], [-92, 0], [-68, 0], [0, -30], [0, 54], [0, -126], [194, 0], [0, -36], [-218, 0], [0, -42], [-34, 0], [-46, 0], [-398, 0], [0, 150], [86, 0], [0, -138], [0, 0], [134, 0], [0, -138], [0, -78], [0, -114], [0, 150], [2, 0], [448, 0], [0, 84], [-248, 0], [0, 66], [-272, 0], [0, 24], [-278, 0], [0, -54], [-598, 0], [358, 0], [0, -114], [518, 0], [0, 126], [0, 156], [178, 0], [532, 0], [86, 0], [0, 54], [0, 186], [28, 0], [0, -120], [-214, 0], [0, -78], [-238, 0], [0, -108], [382, 0], [-274, 0], [0, -342], [0, -348], [-446, 0], [0, -42], [-854, 0], [0, -6], [0, 24], [-2, 0], [0, -210], [-514, 0], [0, 294], [0, -138], [0, 300], [832, 0], [314, 0], [-536, 0], [0, -402], [0, -366], [0, 0], [-526, 0], [-122, 0], [0, -102], [0, -330], [0, -36], [-766, 0], [-206, 0], [556, 0], [0, -174], [-514, 0], [1094, 0], [0, 72], [-404, 0], [0, 522], [0, 342], [0, 354], [-118, 0], [-194, 0], [0, 186], [0, -42], [122, 0], [0, -258], [1166, 0], [0, -96], [1318, 0], [136, 0], [-682, 0], [0, 390], [-658, 0], [-1112, 0], [0, -36], [206, 0], [0, 486], [1168, 0], [0, -534], [0, 408], [674, 0], [0, -606], [-98, 0], [0, 366], [398, 0], [0, -444], [-668, 0], [0, 138], [278, 0], [0, -162], [-572, 0], [0, -360], [1132, 0], [0, 546], [-716, 0], [0, -564], [866, 0], [0, 132], [1018, 0], [0, 534], [0, -330], [0, -690], [1414, 0], [0, 150], [0, 18], [0, -210], [914, 0], [1264, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_300_g_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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