
// Make newform 462.2.j.e in Magma, downloaded from the LMFDB on 17 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_462_j();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_462_j_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_462_2_j_e();".
// 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_462_2_j_e();".
// 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 := [121, 0, 66, 0, 16, 0, 1, 0, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0, 0], [-363, 0, 629, 0, -37, 0, 7, 0], [-539, 0, -525, 0, 148, 0, -28, 0], [0, -539, 0, -525, 0, 148, 0, -28], [2761, 0, 750, 0, 73, 0, 40, 0], [0, -1672, 0, -646, 0, 38, 0, -61], [0, 3300, 0, 1275, 0, -75, 0, 68]];
    Rf_basisdens := [1, 1, 1991, 1991, 1991, 1991, 1991, 1991];
    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_462_j();"
function MakeCharacter_462_j()
    N := 462;
    order := 5;
    char_gens := [155, 199, 211];
    v := [5, 5, 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_462_j_Hecke();"
function MakeCharacter_462_j_Hecke(Kf)
    N := 462;
    order := 5;
    char_gens := [155, 199, 211];
    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, 1, 0, 0, 0, 0, 0], [-1, 0, -1, -1, 0, 1, 0, 0], [0, 1, -1, -1, 1, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0, 0], [0, 2, 0, 0, 0, 0, 0, -1], [1, 0, 1, 1, 0, 0, 1, 0], [0, 0, 1, 1, 2, -2, 2, 2], [-2, 1, -2, 0, 0, 0, 0, 0], [0, 1, 1, 0, 0, -1, 0, -1], [1, -1, 0, 5, 1, -1, 1, 1], [-2, 0, 1, -2, 0, 0, 1, 2], [1, 1, 0, -2, 0, -1, -1, 0], [-4, 0, -4, -3, 2, 3, -2, 0], [3, -2, 1, 0, -3, -1, 0, 2], [4, 2, 4, -1, 3, 1, -3, 0], [0, 0, -1, 0, 0, 0, 2, -1], [-1, -1, 0, -3, 3, 1, 1, 3], [0, 3, 6, 6, 1, -5, -2, -2], [-3, 1, 0, 0, -4, 0, 0, -1], [0, -4, -2, -2, -2, -4, 2, 2], [1, -1, 0, 3, -3, -1, 1, -3], [3, 0, -2, 3, 0, 0, -3, -3], [0, -1, 4, 4, -5, -7, -4, -4], [-1, 2, -1, 0, 6, 1, 0, -2], [-2, 0, -1, -2, 0, 0, 0, -1], [3, 0, 3, 3, 0, 0, 2, 3], [5, -3, 0, -1, -6, -5, 3, -6], [-8, 1, -8, 0, 0, 0, 0, 0], [3, 1, 1, 0, 2, -1, 0, -1], [7, -5, 7, -3, -3, 3, 3, 0], [0, -5, 7, 7, 0, -4, 5, 5], [7, 0, -7, 0, 1, 7, 0, 0], [0, -6, -11, -11, -3, 3, 3, 3], [8, -2, 0, -4, -1, -8, 2, -1], [0, 4, 12, 12, 4, -4, 0, 0], [-1, -1, -1, 6, 2, -6, -2, 0], [-8, -4, -8, 6, -4, -6, 4, 0], [0, 0, 2, 0, 0, 0, -8, 0], [5, 0, 10, 5, 0, 0, -3, 3], [-15, 6, -15, -7, 3, 7, -3, 0], [12, -4, 12, 10, -1, -10, 1, 0], [0, 9, 3, 3, 6, 0, -3, -3], [2, 6, 0, -11, 1, -2, -6, 1], [0, 2, 9, 9, 2, -5, 0, 0], [7, -5, 2, 0, -2, -2, 0, 5], [6, -3, -3, 0, 4, 3, 0, 3], [10, 0, 1, 10, 0, 0, 6, 5], [-8, 3, -8, 7, 3, -7, -3, 0], [-1, 2, 0, 0, 9, 1, -2, 9], [-4, 0, 3, -4, 0, 0, 6, -3], [3, 0, -10, 3, 0, 0, -3, 3], [-14, 9, -14, -11, 3, 11, -3, 0], [1, 1, 8, 0, 2, -8, 0, -1], [4, 0, -7, 4, 0, 0, -2, -1], [7, -4, 0, -6, 2, -7, 4, 2], [-2, 3, -17, 0, -4, 17, 0, -3], [0, 4, -2, -2, 8, -4, 4, 4], [-4, -4, 0, -21, 3, 4, 4, 3], [6, 0, 7, 6, 0, 0, -1, 5], [0, -3, 8, 8, -9, -7, -6, -6], [8, -4, 8, -6, -3, 6, 3, 0], [11, 1, 0, 4, 0, -11, -1, 0], [-2, 7, 2, 0, -7, -2, 0, -7], [-3, 11, -3, 5, 3, -5, -3, 0], [0, 2, -4, -4, 0, 0, -2, -2], [10, 0, 3, 10, 0, 0, 0, 5], [-9, -9, -6, 0, -6, 6, 0, 9], [5, 0, 0, 1, -8, -5, 0, -8], [0, -10, -2, -2, -3, -18, 7, 7], [16, 8, 16, 9, 1, -9, -1, 0], [-6, 0, 6, 0, -8, -6, 0, 0], [-4, 4, 0, -17, -7, 4, -4, -7], [8, 2, 0, -3, -1, -8, -2, -1], [-7, 1, 15, 0, -4, -15, 0, -1], [0, -2, 11, 11, 1, -3, 3, 3], [-10, 0, -10, -10, 0, 0, 2, 6], [3, 0, 0, -8, -3, -3, 0, -3], [19, -1, -4, 0, 6, 4, 0, 1], [0, -1, -4, -4, -3, -7, -2, -2], [12, 0, 16, 12, 0, 0, 2, -6], [-5, 7, -8, 0, -2, 8, 0, -7], [-5, 6, -5, 3, 9, -3, -9, 0], [-6, 0, 3, -6, 0, 0, -9, -10], [1, 14, 0, 4, -9, -1, -14, -9], [3, -12, -6, 0, 7, 6, 0, 12], [2, 7, 2, -14, 0, 14, 0, 0], [-1, 0, -2, -1, 0, 0, -1, -15], [0, 2, 14, 14, -6, -10, -8, -8], [0, -6, 12, 0, 0, -12, 0, 6], [3, 6, -1, 0, 9, 1, 0, -6], [0, 5, -2, -2, 1, 15, -4, -4], [0, 8, -10, -10, 10, -2, 2, 2], [25, 3, 25, 21, 3, -21, -3, 0], [16, 4, 0, 8, 5, -16, -4, 5], [5, -2, 0, -2, -7, -5, 2, -7], [-17, -7, -17, -21, -9, 21, 9, 0], [9, 15, 9, 0, 9, 0, -9, 0], [-13, 2, 0, 9, -2, 13, -2, -2], [0, -11, -6, -6, -6, -4, 5, 5], [-5, 0, -13, -5, 0, 0, -4, 7], [-7, 7, -7, -4, 14, 4, -14, 0], [-24, -2, 0, -4, -4, 24, 2, -4], [15, 0, 11, 15, 0, 0, 11, -4], [5, -1, 5, 16, -6, -16, 6, 0], [-14, -2, -2, 0, -4, 2, 0, 2], [0, 9, -10, -10, -5, 21, -14, -14], [4, -4, 0, -6, 8, -4, 4, 8], [0, 0, -3, 0, -10, 3, 0, 0], [0, 3, 7, 7, 5, 7, 2, 2], [10, 12, 0, -10, 6, -10, -12, 6], [-7, 0, 8, -7, 0, 0, 0, -3], [9, 20, 9, 1, 3, -1, -3, 0], [-15, -5, 10, 0, 2, -10, 0, 5], [2, 0, 2, 18, 5, -18, -5, 0], [-2, -5, 0, -5, 16, 2, 5, 16], [10, -12, 10, -7, -7, 7, 7, 0], [0, -7, 6, 6, -6, 4, 1, 1], [-1, 0, -16, -1, 0, 0, 5, 3], [3, 2, 0, 6, 11, -3, -2, 11], [8, 5, 6, 0, 15, -6, 0, -5], [11, 7, 6, 0, 0, -6, 0, -7], [2, 0, 10, 2, 0, 0, -16, -2], [0, 0, 12, 12, 10, -14, 10, 10], [-2, -1, 24, 0, 5, -24, 0, 1], [10, 0, 0, 10, 0, 0, -13, 0], [-13, 1, -13, -21, 7, 21, -7, 0], [0, 5, -9, -9, 11, 24, 6, 6], [6, -3, 0, -11, -2, -6, 3, -2], [6, -3, 5, 0, 2, -5, 0, 3], [-29, 3, 0, -17, 5, 29, -3, 5], [-28, 0, -22, -28, 0, 0, 2, -2], [0, 1, -2, -2, 6, 15, 5, 5], [-3, -1, -3, -10, 4, 10, -4, 0], [0, 0, -3, 0, 0, 0, -9, -5], [4, 0, 2, 4, 0, 0, -2, 2], [-27, -2, 7, 0, 3, -7, 0, 2], [-12, -8, -12, -18, -8, 18, 8, 0], [0, 4, 0, 0, -5, -4, -9, -9], [0, -11, 13, 13, 1, -6, 12, 12], [0, 3, 3, 3, -6, -28, -9, -9], [12, 14, 12, 16, 10, -16, -10, 0], [9, 1, 0, 7, 9, -9, -1, 9], [15, 0, -13, 15, 0, 0, 7, 0], [10, 0, -8, 10, 0, 0, 3, -6], [21, -3, 0, 37, 5, -21, 3, 5], [-25, -5, -25, -6, -6, 6, 6, 0], [0, 0, -4, -4, -2, 34, -2, -2], [0, -8, -4, 0, 8, 4, 0, 8], [20, -6, 0, 0, -12, 0, 0, 6], [0, 5, 32, 32, 2, -21, -3, -3], [16, 4, 16, -8, 2, 8, -2, 0], [13, -8, -11, 0, 8, 11, 0, 8], [1, -11, 1, 1, 3, -1, -3, 0], [-9, -5, 0, -15, 1, 9, 5, 1], [0, -8, -8, -8, -6, 36, 2, 2], [6, 0, 34, 6, 0, 0, -6, -4], [0, -23, 6, 6, -7, 15, 16, 16], [0, -2, -39, -39, 0, 20, 2, 2], [-1, 0, -10, -1, 0, 0, 5, 5], [0, 2, -24, -24, -5, 27, -7, -7], [-18, 1, 18, 0, 7, -18, 0, -1], [1, 5, 0, 19, -17, -1, -5, -17], [-16, 5, -29, 0, 3, 29, 0, -5], [2, -16, 2, 3, -13, -3, 13, 0], [13, 0, 2, 13, 0, 0, -19, -3], [-6, -4, 0, 26, 2, 6, 4, 2], [-6, 16, -4, 0, 6, 4, 0, -16], [-17, 3, 0, -7, 5, 17, -3, 5]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_462_j_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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