
// Make newform 310.2.b.b in Magma, downloaded from the LMFDB on 19 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_310_b();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_310_b_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_310_2_b_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_310_2_b_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 := [1, -8, 32, -34, 18, 0, 2, -2, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0, 0, 0, 0, 0], [-4773, -408, 1637, -1769, -432, -30, 102, -97], [4226, -3930, 2984, 3132, 444, -241, 167, 145], [4293, 2040, -8185, 8845, 529, 150, -510, 485], [2213, -15353, 16176, -9966, -138, -961, 984, -552], [1236, -4948, 5281, -2400, 24, -309, 305, -137], [4334, -30067, 38219, -19500, -271, -1899, 2216, -1084], [1769, -37656, 49100, -30006, -823, -2481, 2890, -1661]];
    Rf_basisdens := [1, 1631, 1631, 1631, 1631, 233, 1631, 1631];
    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_310_b();"
function MakeCharacter_310_b()
    N := 310;
    order := 2;
    char_gens := [187, 251];
    v := [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_310_b_Hecke();"
function MakeCharacter_310_b_Hecke(Kf)
    N := 310;
    order := 2;
    char_gens := [187, 251];
    char_values := [[-1, 0, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 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, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 1, 0], [-1, -1, 0, 0, 0, 0, 0, 1], [0, 0, 1, 0, 1, 0, -1, 1], [2, 1, 0, 0, 0, 0, 0, 0], [0, 0, 2, 0, -2, -1, -1, 1], [0, 0, 1, 0, 1, -1, 1, 0], [-2, 0, 0, 2, 0, -1, 0, 1], [0, 0, 1, 0, -1, 1, -3, 2], [2, -1, 0, -2, 0, 1, 0, -1], [1, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 4, 0, -1, 0], [-5, -3, 0, 3, 0, -2, 0, 2], [0, 0, -2, 0, -2, 1, -3, -1], [0, 0, -3, 0, 5, 2, 3, -1], [0, 0, -6, 0, 2, 3, 1, -3], [6, 6, 0, -2, 0, 4, 0, -4], [-2, -5, 0, -2, 0, -1, 0, 1], [0, 0, -2, 0, 8, 1, 4, -1], [8, 4, 0, -2, 0, 4, 0, -4], [0, 0, 5, 0, -5, -5, 1, 0], [4, 0, 0, -2, 0, 0, 0, 0], [0, 0, -2, 0, 2, 4, -3, 2], [4, -4, 0, -4, 0, 2, 0, -2], [0, 0, 3, 0, 5, -4, -3, -1], [2, 4, 0, 0, 0, 5, 0, -5], [0, 0, 2, 0, 2, -4, 6, -2], [0, 0, -6, 0, 0, 5, -4, -1], [4, 0, 0, -6, 0, -1, 0, 1], [0, 0, -1, 0, -3, -2, 1, -3], [0, 0, 5, 0, -3, -5, 1, 0], [4, 4, 0, -4, 0, 3, 0, -3], [0, 0, -1, 0, -1, -1, -1, -2], [10, -1, 0, -2, 0, -3, 0, 3], [-2, 4, 0, 8, 0, -2, 0, 2], [-6, -4, 0, 6, 0, -2, 0, 2], [0, 0, 0, 0, 6, 0, 2, 0], [0, 0, -6, 0, -10, 4, -4, -2], [0, 0, 3, 0, -3, -3, 3, 0], [0, 0, -2, 0, 8, 0, 4, -2], [10, 7, 0, -10, 0, 5, 0, -5], [-16, -5, 0, -2, 0, -4, 0, 4], [-5, -1, 0, 1, 0, 0, 0, 0], [0, 0, 8, 0, -10, -4, 0, 4], [0, 0, 4, 0, -8, -6, 1, -2], [8, 2, 0, 2, 0, 4, 0, -4], [6, 12, 0, 2, 0, 1, 0, -1], [0, 0, -1, 0, -3, -1, 9, -2], [0, 0, 0, 0, -16, 2, 0, 2], [4, 3, 0, 0, 0, 3, 0, -3], [0, 0, -1, 0, -3, 0, -3, -1], [-2, 0, 0, 2, 0, 4, 0, -4], [6, 8, 0, -2, 0, 10, 0, -10], [-14, -3, 0, 12, 0, -4, 0, 4], [0, 0, -8, 0, -12, 4, -4, -4], [0, 0, 7, 0, 3, -3, 3, 4], [-14, -3, 0, 12, 0, 0, 0, 0], [14, 0, 0, -6, 0, 0, 0, 0], [0, 0, -14, 0, -2, 9, -1, -5], [0, -2, 0, -6, 0, 2, 0, -2], [0, 0, 2, 0, -10, -6, 2, -4], [0, 0, 2, 0, 10, 1, 8, 3], [0, 0, 8, 0, -2, -3, -8, 5], [-2, -6, 0, 8, 0, -6, 0, 6], [0, 0, -7, 0, 5, 7, -7, 0], [0, 0, 2, 0, 4, 4, 0, 6], [8, -3, 0, -8, 0, 5, 0, -5], [0, 0, 9, 0, -17, -1, -15, 8], [0, 0, 0, 0, 0, 2, -11, 2], [-6, 0, 0, 4, 0, 4, 0, -4], [0, 0, 1, 0, 19, -3, 5, -2], [-17, 3, 0, 3, 0, -2, 0, 2], [0, 0, -7, 0, -3, -1, -1, -8], [0, 0, 4, 0, -8, 1, 0, 5], [0, -2, 0, -4, 0, -6, 0, 6], [0, 0, 3, 0, 1, -1, -7, 2], [0, -1, 0, 6, 0, -6, 0, 6], [0, 0, 10, 0, -4, 0, -8, 10], [-22, -2, 0, 0, 0, 2, 0, -2], [12, 8, 0, -2, 0, 6, 0, -6], [0, 4, 0, -12, 0, 2, 0, -2], [12, 4, 0, 2, 0, -2, 0, 2], [3, -1, 0, 3, 0, -6, 0, 6], [0, 0, -7, 0, 1, -1, 13, -8], [7, 11, 0, 5, 0, 4, 0, -4], [0, 0, -6, 0, 6, 4, 0, -2], [20, 8, 0, -10, 0, 0, 0, 0], [0, 0, -3, 0, 19, -1, 15, -4], [12, 7, 0, -2, 0, 2, 0, -2], [0, 0, 1, 0, -15, -3, -1, -2], [0, 0, -14, 0, 12, 9, 0, -5], [6, -2, 0, -20, 0, 2, 0, -2], [0, 0, 3, 0, 5, 3, -7, 6], [-20, -3, 0, 12, 0, -11, 0, 11], [2, -1, 0, -16, 0, 0, 0, 0], [0, 0, -4, 0, 10, 2, 4, -2], [-14, -17, 0, 0, 0, -8, 0, 8], [0, -2, 0, -10, 0, -4, 0, 4], [0, 0, 10, 0, -2, -11, -5, -1], [20, 12, 0, 6, 0, 5, 0, -5], [0, 0, 2, 0, 18, 0, -6, 2], [0, 0, 10, 0, -6, 0, -11, 10], [0, 0, -6, 0, -16, 3, -6, -3], [-20, -6, 0, 12, 0, -2, 0, 2], [-10, -23, 0, 0, 0, -4, 0, 4], [0, 0, -3, 0, -5, 4, -1, 1], [0, 0, 2, 0, -6, -11, 15, -9], [0, 0, 5, 0, -5, -4, -1, 1], [-21, -1, 0, 11, 0, -8, 0, 8], [-10, 2, 0, 6, 0, 0, 0, 0], [0, 0, 6, 0, 8, -10, 2, -4], [0, 0, -4, 0, -16, -2, 3, -6], [0, 0, -8, 0, 30, 4, 4, -4], [-24, -7, 0, 10, 0, 2, 0, -2], [24, 2, 0, -16, 0, 0, 0, 0], [-4, 0, 0, -6, 0, 4, 0, -4], [0, 0, 6, 0, -14, -6, -1, 0], [0, 0, 1, 0, -11, -7, 5, -6], [0, 0, 2, 0, 2, 1, -4, 3], [-2, 2, 0, 6, 0, 5, 0, -5], [-18, -12, 0, -4, 0, -1, 0, 1], [0, 0, -11, 0, -13, 11, -5, 0], [0, 0, 16, 0, -8, -5, -7, 11], [0, 0, -2, 0, -12, -3, 20, -5], [24, -2, 0, -8, 0, 2, 0, -2], [-2, 10, 0, -12, 0, 4, 0, -4], [-4, 7, 0, -6, 0, 8, 0, -8], [-24, -2, 0, 10, 0, 2, 0, -2], [0, 0, -4, 0, -14, 4, -24, 0], [0, 0, -4, 0, 2, 12, -8, 8], [-4, -13, 0, 12, 0, -5, 0, 5], [0, 0, 13, 0, -9, 3, -5, 16], [-17, 7, 0, 7, 0, 0, 0, 0], [0, 0, -8, 0, 44, 4, 5, -4], [-12, 2, 0, -12, 0, 4, 0, -4], [-19, -1, 0, 25, 0, -8, 0, 8], [0, 0, -18, 0, -6, 15, -9, -3], [0, 0, -4, 0, -8, 8, -13, 4], [0, 0, -10, 0, 30, 2, 19, -8], [6, -6, 0, -16, 0, -2, 0, 2], [10, 22, 0, -18, 0, 14, 0, -14], [-8, 9, 0, 8, 0, -3, 0, 3], [0, 0, -3, 0, 9, 1, 9, -2], [0, 0, 0, 0, -16, 5, -11, 5], [-12, 1, 0, -2, 0, -2, 0, 2], [15, 23, 0, 11, 0, 4, 0, -4], [0, 0, -4, 0, -4, -11, 14, -15], [0, 0, -20, 0, 22, 10, 16, -10], [-20, 7, 0, 10, 0, 0, 0, 0], [0, 0, 11, 0, -1, -13, 15, -2], [0, 0, 0, 0, -26, 0, 4, 0], [-34, -14, 0, 2, 0, -14, 0, 14], [0, 0, 20, 0, -4, 2, -9, 22], [0, 0, 7, 0, -9, -2, 5, 5], [0, 0, 14, 0, 4, -15, -8, -1], [20, 10, 0, -2, 0, -2, 0, 2], [12, 4, 0, -6, 0, 0, 0, 0], [18, 10, 0, 16, 0, 0, 0, 0], [0, 0, 18, 0, 4, -2, -6, 16], [6, -11, 0, 12, 0, -4, 0, 4], [0, 0, -6, 0, -22, 6, -9, 0], [0, 0, -3, 0, -5, -3, -9, -6], [0, 0, 17, 0, 17, -1, -3, 16], [26, 10, 0, -14, 0, 2, 0, -2], [0, 0, 12, 0, 20, -14, 0, -2], [0, 0, 13, 0, -3, -3, 1, 10], [20, -2, 0, -2, 0, -2, 0, 2], [0, 0, -10, 0, 18, 11, 8, 1]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_310_b_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_310_2_b_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_310_2_b_b(:prec:=8)
    chi := MakeCharacter_310_b();
    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_310_2_b_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_310_2_b_b( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_310_b();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<3,R![4, 0, 52, 0, 44, 0, 12, 0, 1]>],Snew);
    return Vf;
end function;