
// Make newform 304.3.e.b in Magma, downloaded from the LMFDB on 18 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_304_e();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_304_e_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_304_3_e_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_304_3_e_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 := [29, 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_304_e();"
function MakeCharacter_304_e()
    N := 304;
    order := 2;
    char_gens := [191, 229, 97];
    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_304_e_Hecke();"
function MakeCharacter_304_e_Hecke(Kf)
    N := 304;
    order := 2;
    char_gens := [191, 229, 97];
    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 := 3;
    raw_aps := [[0, 0], [0, 1], [-4, 0], [1, 0], [-14, 0], [0, -3], [23, 0], [-10, 3], [1, 0], [0, 9], [0, -6], [0, -6], [0, -6], [-68, 0], [-26, 0], [0, 15], [0, 3], [-40, 0], [0, -3], [0, -6], [-7, 0], [0, 18], [-32, 0], [0, 24], [0, 18], [14, 0], [0, 24], [0, 3], [0, -3], [0, -18], [0, -12], [-56, 0], [-19, 0], [-122, 0], [-82, 0], [0, -42], [242, 0], [214, 0], [0, 6], [0, 30], [0, 54], [0, -18], [67, 0], [0, 18], [-142, 0], [-263, 0], [0, -15], [0, -48], [0, -15], [-304, 0], [2, 0], [-89, 0], [0, 30], [370, 0], [0, 36], [394, 0], [0, -18], [403, 0], [206, 0], [0, 48], [-56, 0], [0, 15], [0, 78], [265, 0], [77, 0], [0, -75], [0, -81], [0, 72], [-392, 0], [410, 0], [-481, 0], [109, 0], [-50, 0], [0, -93], [0, 39], [0, 48], [578, 0], [-658, 0], [0, 144], [0, -66], [-8, 0], [0, -93], [0, -120], [0, -36], [0, -60], [-182, 0], [0, 78], [317, 0], [-172, 0], [-146, 0], [-662, 0], [130, 0], [0, 72], [280, 0], [460, 0], [-263, 0], [0, 54], [0, 42], [0, 15], [-640, 0], [0, 6], [-844, 0], [0, 78], [0, -54], [-458, 0], [-85, 0], [-488, 0], [-610, 0], [0, -60], [0, 18], [0, 186], [200, 0], [530, 0], [256, 0], [826, 0], [0, 108], [-170, 0], [25, 0], [-1054, 0], [0, -231], [0, 99], [0, 54], [0, -177], [0, 162], [-668, 0], [-700, 0], [1292, 0], [-1061, 0], [-83, 0], [296, 0], [-548, 0], [0, 114], [0, 78], [188, 0], [-1183, 0], [-1177, 0], [0, -189], [0, 21], [0, 33], [737, 0], [0, 147], [122, 0], [-1499, 0], [0, -177], [0, -15], [0, 72], [536, 0], [0, -228], [496, 0], [0, -108], [0, 201], [302, 0], [1480, 0], [0, 180], [0, 3], [0, -84], [-515, 0], [671, 0], [1601, 0], [0, -291], [1192, 0], [0, 156], [514, 0], [0, -318], [0, 30], [0, 48], [0, 168], [-394, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_304_e_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_304_3_e_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_304_3_e_b(:prec:=2)
    chi := MakeCharacter_304_e();
    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_304_3_e_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_304_3_e_b( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_304_e();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,3,sign)));
    Vf := Kernel([<3,R![29, 0, 1]>,<5,R![4, 1]>],Snew);
    return Vf;
end function;