
// Make newform 300.2.m.b in Magma, downloaded from the LMFDB on 18 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_300_m();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_300_m_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_2_m_b();".
// 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_2_m_b();".
// 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 := [16, -24, 8, 0, 1, 0, 2, -3, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0, 0, 0, 0, 0], [-8, 4, 2, 1, 0, 0, -1, 1], [-12, 12, -2, 1, 0, 0, -1, 1], [64, -60, -4, 1, 4, 2, 9, -7], [-96, 92, 2, 3, -8, -4, -15, 11], [-88, 96, 4, 3, -8, -6, -13, 11], [-144, 120, 10, 5, -4, -4, -21, 13], [-224, 180, 18, 11, -8, -4, -31, 19]];
    Rf_basisdens := [1, 8, 4, 8, 8, 8, 8, 8];
    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_300_m();"
function MakeCharacter_300_m()
    N := 300;
    order := 5;
    char_gens := [151, 101, 277];
    v := [5, 5, 4];
    // 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_m_Hecke();"
function MakeCharacter_300_m_Hecke(Kf)
    N := 300;
    order := 5;
    char_gens := [151, 101, 277];
    char_values := [[1, 0, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, -1, 0, 0, 0, 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 := 2;
    raw_aps := [[0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0, 0], [-1, 0, 0, 0, 0, 0, 1, -1], [0, 0, -1, 2, 0, 0, 1, 1], [1, 0, -1, -1, 0, -1, 0, 0], [-2, 3, 0, 3, 2, -1, 2, 1], [1, -2, -1, 0, -1, 1, -2, 0], [0, -1, -1, 1, 0, 1, 1, 1], [-1, -1, -1, 1, 0, -2, 0, 0], [0, 0, 0, -1, 0, 0, 0, 1], [2, -1, 1, -3, -2, -1, -4, -3], [-2, 2, 0, 2, 3, 0, 2, 0], [3, -1, 0, -1, -4, 0, -3, 0], [0, 0, 2, -3, 0, 0, -1, -2], [0, -6, -2, -7, -2, 0, -6, -1], [0, -3, 2, -2, 2, 0, -3, -1], [-3, -5, 0, -5, -2, 1, 3, -1], [8, 3, 2, -8, 0, -2, 0, 0], [1, -3, -2, 2, 0, 2, -10, 2], [0, -3, 0, -7, 0, 0, -3, -1], [-3, -2, 2, 3, 0, 2, 0, 0], [0, -4, -1, 1, -1, 0, -4, 4], [4, 2, 6, -2, 4, -6, -3, -2], [-6, 7, 3, 6, 0, 1, 0, 0], [0, -2, 4, -1, 4, 0, -2, -4], [-7, -2, -1, 6, -2, 2, 5, 1], [0, 6, -1, -5, -1, 0, 6, -1], [2, 0, -4, 7, 0, 0, 3, 4], [7, -4, 0, -4, 3, -5, -7, 5], [-13, 14, 0, 14, 2, -3, 13, 3], [-2, -7, -6, 2, 0, 1, 0, 0], [5, -7, -2, 5, 3, 2, -3, 5], [-1, 7, 0, 7, -4, 3, 1, -3], [-10, 14, -4, 10, 0, -2, 0, 0], [1, 3, 0, 10, 3, -3, 10, 0], [-7, 2, 4, 3, 2, -2, 7, -4], [-9, 5, 4, 2, 5, -5, 6, -4], [-2, -3, 0, -3, -3, 6, 2, -6], [3, -2, 1, 2, 3, -1, -1, 2], [-6, -4, 0, 6, 0, 1, 0, 0], [0, 5, 5, -7, 5, 0, 5, -1], [8, -5, 3, -5, -2, -3, -10, -5], [-10, 17, 0, 17, 10, -3, 10, 3], [0, -3, -5, -3, -3, 3, -8, 5], [0, 1, 0, -3, 0, 0, 1, 6], [11, -1, -1, 2, -1, 1, 1, 1], [-3, 11, -3, 3, 0, -3, 0, 0], [6, -5, 1, -6, 0, 7, 0, 0], [8, -3, 6, -8, 0, 1, 0, 0], [0, -15, -7, -11, -7, 0, -15, -1], [-1, -5, -6, 3, -3, 6, 2, 3], [-10, 10, -2, 10, 0, 3, 0, 0], [12, -20, 0, -20, -7, 7, -12, -7], [-19, 2, 1, 13, 2, -2, 14, -1], [-2, -3, 7, -6, -3, 3, 1, -7], [-7, 4, 0, 4, -2, -2, 7, 2], [8, -2, 6, -8, -2, -6, -14, -8], [0, 4, 7, -5, 7, 0, 4, 0], [14, -18, 9, -14, 0, 5, 0, 0], [3, -10, -7, 3, -4, 7, -19, 3], [-4, -3, -7, -3, -10, 7, -14, -3], [18, -2, -2, -14, -2, 2, -16, 2], [7, -3, 0, 6, -3, 3, 6, 0], [5, -9, 2, -5, 0, 6, 0, 0], [-1, -10, 0, -10, -6, 2, 1, -2], [-2, 3, 1, -6, -5, -1, 14, -6], [10, -8, 2, 5, 7, -2, -6, 5], [-12, 15, 0, 15, 3, -1, 12, 1], [0, -12, -2, -24, -2, 0, -12, -1], [-2, 6, -1, 13, 6, -6, 12, 1], [0, -2, -1, 7, -1, 0, -2, 4], [-13, 6, 0, 6, 0, 3, 13, -3], [-3, 4, 1, 3, 4, -1, -7, 3], [-8, 8, -9, 8, 0, -2, 0, 0], [0, -14, -3, -7, -3, 0, -14, -8], [-3, 1, -2, -4, -6, 2, -6, -4], [-10, 11, -4, 10, 0, -11, 0, 0], [0, 6, 7, 0, 7, 0, 6, 1], [-8, 1, -7, 20, 1, -1, 13, 7], [8, 0, 0, 0, -5, 0, -8, 0], [7, -10, -3, 0, -3, 3, 3, 0], [0, 17, 3, 11, 3, 0, 17, -6], [2, 1, 3, -7, -4, -3, -18, -7], [7, -5, 2, 3, 5, -2, -7, 3], [3, -3, 4, -3, 0, 4, 0, 0], [15, 4, 0, 1, 4, -4, 1, 0], [-5, 4, 1, 14, 4, -4, 15, -1], [0, 5, 3, 15, 5, -5, 18, -3], [7, -22, -6, -7, 0, 2, 0, 0], [-11, 7, 0, 7, -2, 2, 11, -2], [7, -6, 1, -2, -1, -1, 6, -2], [0, -15, -14, -12, -14, 0, -15, 2], [17, -15, 0, -15, -2, 3, -17, -3], [-2, 5, 0, 5, -5, 7, 2, -7], [8, 6, -4, 14, 6, -6, 10, 4], [0, -13, -10, -11, -10, 0, -13, -6], [1, -5, 0, -5, 6, -3, -1, 3], [0, 7, -5, -7, -5, 0, 7, 8], [0, -2, -5, 0, 0, -2, 0, 0], [-5, 2, 0, 2, 0, -2, 5, 2], [0, -5, -4, -16, -4, 0, -5, 0], [-10, -5, -11, 9, -5, 5, -2, 11], [-8, -9, 0, -9, 0, 2, 8, -2], [9, -9, 0, 2, 2, 0, -20, 2], [0, -6, -7, -5, -7, 0, -6, 5], [-6, -8, 3, 6, 0, -3, 0, 0], [-1, 5, 0, 5, -2, 8, 1, -8], [20, -3, 1, -24, -3, 3, -23, -1], [16, -4, 1, -18, -4, 4, -17, -1], [6, -4, -4, 1, -4, 4, -3, 4], [19, -2, -4, -16, -2, 2, -20, 4], [13, -7, 0, -7, 0, -3, -13, 3], [11, -13, -2, 11, 9, 2, 1, 11], [-13, 19, 6, -4, 2, -6, 7, -4], [15, -14, 1, 1, 2, -1, 10, 1], [18, -12, 0, -12, 7, 0, -18, 0], [-13, 6, 7, 11, 6, -6, 18, -7], [0, -22, 5, -15, 5, 0, -22, 3], [0, 0, 1, 23, 1, 0, 0, -4], [-9, 2, 0, 2, -6, -7, 9, 7], [-4, 16, 8, 4, 0, 0, 0, 0], [-11, -6, 6, 11, 0, -9, 0, 0], [-1, 16, 2, 1, 0, 3, 0, 0], [-9, 5, -4, 5, 1, 4, 1, 5], [-2, 5, 0, 5, -1, -9, 2, 9], [26, -4, 10, -8, -4, 4, 2, -10], [17, -22, 0, -22, -18, 8, -17, -8], [-12, 8, -4, 10, 6, 4, 11, 10], [12, -14, -6, -12, 0, 9, 0, 0], [10, 2, 12, -7, 5, -12, -23, -7], [-7, -9, 0, 7, 0, 5, 0, 0], [24, -2, 2, -9, -2, 2, -7, -2], [-6, -3, -12, 10, -3, 3, -2, 12], [6, -12, -6, -3, -12, 12, -9, 6], [0, -6, 2, 0, 0, -11, 0, 0], [-15, 7, -8, 5, -3, 8, 29, 5], [-2, 4, -9, 2, 0, 8, 0, 0], [10, -23, 0, -23, -2, 0, -10, 0], [0, -16, -11, -10, -11, 0, -16, 2], [-24, 8, 0, 8, 12, 4, 24, -4], [-2, 9, -1, 2, 0, -9, 0, 0], [0, 5, 6, 30, 6, 0, 5, 5], [7, -21, 8, -7, 0, -2, 0, 0], [-21, -2, -7, 21, 0, 10, 0, 0], [0, 16, -5, 9, -5, 0, 16, 11], [-10, -9, -3, 10, 0, -4, 0, 0], [0, 2, -9, 14, -9, 0, 2, -12], [-5, 19, 7, -8, 19, -19, -1, -7], [-18, 30, 0, 30, 17, -7, 18, 7], [-5, 18, 0, 18, 3, 3, 5, -3], [19, 9, -1, -19, 0, -3, 0, 0], [-2, 2, 0, -4, -4, 0, 0, -4], [-1, 6, 5, -4, 1, -5, 5, -4], [-44, 52, 0, 52, 9, -5, 44, 5], [-5, 1, -13, 13, 1, -1, 0, 13], [-11, 18, -14, 11, 0, -3, 0, 0], [1, 9, 10, -8, 2, -10, 22, -8], [0, 12, -11, -1, -11, 0, 12, 4], [13, -10, 0, -10, 5, -7, -13, 7], [-20, 2, 0, 2, -7, 2, 20, -2], [0, 18, 17, -2, 17, 0, 18, -5], [0, 10, 6, 28, 6, 0, 10, 12], [11, -29, -18, 1, -17, 18, -13, 1], [0, -3, 3, -4, 3, 0, -3, 10], [4, -5, -11, -4, 0, -1, 0, 0], [-9, 7, -2, 1, -1, 2, 17, 1], [-10, 1, 0, 1, -6, 8, 10, -8], [0, 9, -8, 32, -8, 0, 9, 4]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_300_m_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_300_2_m_b();".
// 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_2_m_b(:prec:=8)
    chi := MakeCharacter_300_m();
    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_300_2_m_b();".
// 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_2_m_b( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_300_m();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<7,R![1, 11, -4, -4, 1]>],Snew);
    return Vf;
end function;