
// Make newform 322.2.e.b in Magma, downloaded from the LMFDB on 25 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_322_e();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_322_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_322_2_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_322_2_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 := [7, -38, 64, -40, 38, -10, 1, -2, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0, 0, 0, 0, 0], [23150, -10595, 17846, -6480, -193, -619, 688, -14], [-21668, 13756, -23147, 8788, -716, 957, -743, 74], [-2218, -9416, 15724, -5887, 688, -648, 465, -139], [14432, -52069, 36565, -43953, 11731, -262, 2176, -1269], [18369, -49196, 25443, -33224, 9308, -288, 1557, -962], [88979, -241837, 128118, -149399, 42410, -2449, 7290, -4270], [-98045, 265634, -139939, 167278, -47477, 2087, -8118, 4805]];
    Rf_basisdens := [1, 8102, 8102, 8102, 8102, 4051, 8102, 8102];
    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_322_e();"
function MakeCharacter_322_e()
    N := 322;
    order := 3;
    char_gens := [185, 281];
    v := [1, 3];
    // 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_322_e_Hecke();"
function MakeCharacter_322_e_Hecke(Kf)
    N := 322;
    order := 3;
    char_gens := [185, 281];
    char_values := [[0, 0, 0, 0, 0, -1, 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, 0, -1, 0, 0], [1, 0, 1, 0, 0, -1, 1, 0], [0, 0, 0, 1, -1, 1, 0, -1], [0, 0, 0, 1, 0, 0, -1, 0], [0, 1, 1, 0, 0, 0, 1, 1], [-2, 0, 1, 1, 0, 0, 0, 0], [0, -3, 0, 0, -1, 0, 0, -3], [0, 0, 0, -1, 1, 3, 2, 1], [0, 0, 0, 0, 0, -1, 0, 0], [0, 0, -2, -1, 0, 0, 0, 0], [4, -1, -1, 0, -2, -4, -1, -1], [0, 0, 0, -1, 1, 0, 1, -1], [-4, 0, 1, -1, 0, 0, 0, 0], [-5, 1, 1, 2, 0, 0, 0, 0], [0, 0, 0, 1, -1, 5, 1, -2], [1, 2, -3, 0, 2, -1, -3, 2], [4, 1, -1, 0, -4, -4, -1, 1], [0, 0, 0, 1, -1, 2, 4, 3], [4, 0, 1, 0, -2, -4, 1, 0], [0, 0, -1, -5, 0, 0, 0, 0], [0, 1, 3, 0, 4, 0, 3, 1], [0, 0, 0, -1, 1, -2, -2, -1], [0, 0, -4, -5, 0, 0, 0, 0], [0, 0, 0, -1, 1, 1, -4, -1], [9, 2, 2, -1, 0, 0, 0, 0], [5, -2, -7, 0, -4, -5, -7, -2], [0, 0, 0, 0, 0, 5, -3, -1], [0, 0, 0, 1, -1, -4, 0, 2], [1, 0, 4, 0, 4, -1, 4, 0], [-6, 3, -3, 1, 0, 0, 0, 0], [-5, 6, 0, 1, 0, 0, 0, 0], [0, 0, 0, -2, 2, 7, -3, 2], [3, -5, -2, 0, 0, -3, -2, -5], [4, -2, -4, 1, 0, 0, 0, 0], [0, 0, 0, -2, 2, 0, -2, -4], [-3, -2, 2, 0, -4, 3, 2, -2], [2, 2, 5, 0, 4, -2, 5, 2], [0, 0, 0, -6, 6, -5, 0, 3], [0, -2, 4, 0, 0, 0, 0, 0], [0, 0, 0, 4, -4, -4, 0, -7], [4, -1, 2, 0, 2, -4, 2, -1], [9, 1, -6, 4, 0, 0, 0, 0], [0, 0, 0, -4, 4, 0, -1, -3], [-8, 5, 3, 0, 1, 8, 3, 5], [1, -5, -2, -2, 0, 0, 0, 0], [-2, -1, 6, 0, 6, 2, 6, -1], [-15, 2, 5, 3, 0, 0, 0, 0], [9, -5, 4, -2, 0, 0, 0, 0], [-9, 10, 5, 0, 6, 9, 5, 10], [0, 0, 0, -2, 2, -5, -5, -6], [0, 0, 0, 0, 0, 9, 3, 4], [2, -5, -1, -5, 0, 0, 0, 0], [-9, 3, -11, 0, 0, 9, -11, 3], [2, 0, 7, -5, 0, 0, 0, 0], [0, 0, 0, 1, -1, -6, 6, 3], [-1, -4, -7, 0, -6, 1, -7, -4], [-7, 3, 13, 0, 4, 7, 13, 3], [0, 0, 0, 7, -7, -1, -4, 2], [-5, 4, -10, 0, 1, 5, -10, 4], [8, 1, 2, -3, 0, 0, 0, 0], [8, 0, 4, 0, -5, -8, 4, 0], [-1, 3, 3, 5, 0, 0, 0, 0], [-11, -1, 1, 0, 0, 0, 0, 0], [6, -2, 5, 0, 5, -6, 5, -2], [0, 0, 0, -9, 9, -8, 2, 4], [0, 0, 0, 2, -2, 5, 10, 3], [0, 0, 0, 9, -9, 11, -3, 0], [6, -6, -1, 0, 0, 0, 0, 0], [10, 5, 0, 0, -4, -10, 0, 5], [5, -6, -5, -4, 0, 0, 0, 0], [10, 2, 5, 0, -2, -10, 5, 2], [0, 0, 0, -2, 2, -4, 5, -7], [-4, 0, 4, 0, -3, 4, 4, 0], [0, 0, 0, -9, 9, 4, 5, 6], [-8, 7, 0, 4, 0, 0, 0, 0], [0, 0, 0, 7, -7, 0, 8, -5], [10, 1, -7, 0, 0, -10, -7, 1], [0, 0, 0, -5, 5, -8, -4, -3], [0, 0, 0, 9, -9, 11, -5, 1], [-18, -2, 3, 0, -4, 18, 3, -2], [-4, 1, -2, 10, 0, 0, 0, 0], [-9, 2, 8, -3, 0, 0, 0, 0], [11, 9, 0, 0, 7, -11, 0, 9], [11, 5, 0, 6, 0, 0, 0, 0], [0, 0, 0, -6, 6, 13, -1, -2], [0, 0, 0, 3, -3, 14, -4, 2], [4, -6, -10, -1, 0, 0, 0, 0], [0, 0, 0, 2, -2, -15, 2, -8], [-19, -2, 2, 3, 0, 0, 0, 0], [-5, -11, -1, -6, 0, 0, 0, 0], [0, 0, 0, 2, -2, 6, 0, 2], [28, 0, 4, 0, 1, -28, 4, 0], [7, 5, -2, 0, 8, -7, -2, 5], [9, -5, 2, 4, 0, 0, 0, 0], [0, 0, 0, 8, -8, 4, 7, -6], [19, -3, -9, -5, 0, 0, 0, 0], [0, 0, 0, 12, -12, 13, 0, -2], [13, 2, -7, 0, -7, -13, -7, 2], [0, 0, 0, 3, -3, -6, -5, 0], [0, 0, 0, -6, 6, -7, -9, -1], [16, -5, 9, -3, 0, 0, 0, 0], [10, 1, -4, 0, 2, -10, -4, 1], [-2, -10, -6, 0, -7, 2, -6, -10], [0, 0, 0, -10, 10, 19, 7, 3], [-1, 0, 12, 0, 5, 1, 12, 0], [-13, 6, 3, 0, 7, 13, 3, 6], [6, 5, 4, 6, 0, 0, 0, 0], [0, 0, 0, 2, -2, -17, -13, -7], [2, 7, 2, 0, 13, -2, 2, 7], [-9, 2, 6, -7, 0, 0, 0, 0], [0, 0, 0, 5, -5, -5, -7, -5], [5, 0, -4, 0, -2, -5, -4, 0], [14, 1, -6, 7, 0, 0, 0, 0], [-6, 1, 6, 0, 7, 6, 6, 1], [9, -1, -7, 1, 0, 0, 0, 0], [3, -5, 2, 0, -9, -3, 2, -5], [2, 0, 7, 2, 0, 0, 0, 0], [20, -2, -3, 0, 2, -20, -3, -2], [0, 0, 0, 4, -4, 18, -3, 2], [-4, 11, -4, -1, 0, 0, 0, 0], [-10, 2, 2, 0, -10, 10, 2, 2], [-17, -2, -13, 0, 0, 0, 0, 0], [0, 0, 0, 2, -2, -24, 2, 3], [-15, -8, 2, 0, -10, 15, 2, -8], [0, 0, 0, -9, 9, 7, 4, 16], [9, -6, -16, -7, 0, 0, 0, 0], [0, 0, 0, -1, 1, 5, 6, 2], [0, 0, 0, 11, -11, -8, -4, 6], [-6, -2, 15, -1, 0, 0, 0, 0], [0, 0, 0, 9, -9, -5, 1, 2], [-8, 14, 7, 0, 4, 8, 7, 14], [-16, 4, 0, -8, 0, 0, 0, 0], [0, 0, 0, 7, -7, 6, -13, 1], [2, 12, -3, 0, 0, 0, 0, 0], [0, 0, 0, 6, -6, 6, -5, 5], [6, -3, -1, 6, 0, 0, 0, 0], [31, -9, -17, 0, -8, -31, -17, -9], [7, 2, -11, 0, -11, -7, -11, 2], [2, 13, -4, -2, 0, 0, 0, 0], [-15, -11, -1, 0, -2, 15, -1, -11], [-24, 4, -9, 1, 0, 0, 0, 0], [0, 0, 0, -6, 6, 4, -4, 17], [-12, 16, 9, 0, 11, 12, 9, 16], [19, 10, 3, -5, 0, 0, 0, 0], [-6, 6, -15, 0, 2, 6, -15, 6], [24, -7, -2, 4, 0, 0, 0, 0], [2, -2, -11, -8, 0, 0, 0, 0], [22, -3, 0, 0, 7, -22, 0, -3], [0, 0, 0, 2, -2, 9, 10, 8], [0, 0, 0, -13, 13, 16, 12, 11], [0, 0, 0, 7, -7, 3, 3, -11], [-13, -17, -3, -5, 0, 0, 0, 0], [-3, -1, -2, 11, 0, 0, 0, 0], [0, 0, 0, 10, -10, 23, 6, -3], [-3, -3, -5, 0, 11, 3, -5, -3], [25, -11, -11, -6, 0, 0, 0, 0], [0, 0, 0, -3, 3, 7, 1, -10], [0, 0, 0, -8, 8, 3, 0, 2], [18, 5, 7, -1, 0, 0, 0, 0], [9, -5, 6, 0, 0, -9, 6, -5], [0, 0, 0, -8, 8, 8, -10, 0], [-12, -2, 6, 13, 0, 0, 0, 0], [-12, 0, 15, -4, 0, 0, 0, 0], [0, 0, 0, 2, -2, 18, -3, -12], [-5, 12, 2, 0, 8, 5, 2, 12], [10, 0, -1, 0, 10, -10, -1, 0], [-19, -7, -8, 0, 4, 19, -8, -7], [20, -13, -4, 0, -11, -20, -4, -13]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_322_e_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_322_2_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_322_2_e_b(:prec:=8)
    chi := MakeCharacter_322_e();
    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_322_2_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_322_2_e_b( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_322_e();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<3,R![49, -77, 142, -37, 71, -37, 22, -5, 1]>],Snew);
    return Vf;
end function;