
// Make newform 798.2.j.h in Magma, downloaded from the LMFDB on 26 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_798_j();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_798_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_798_2_j_h();".
// 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_798_2_j_h();".
// 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 := [4, 0, 2, 0, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, 1, 0], [0, 0, 0, 1]];
    Rf_basisdens := [1, 1, 2, 2];
    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_798_j();"
function MakeCharacter_798_j()
    N := 798;
    order := 3;
    char_gens := [533, 115, 211];
    v := [3, 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_798_j_Hecke();"
function MakeCharacter_798_j_Hecke(Kf)
    N := 798;
    order := 3;
    char_gens := [533, 115, 211];
    char_values := [[1, 0, 0, 0], [0, 0, 1, 0], [1, 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], [1, 0, 1, 0], [0, 1, -3, 1], [-1, 1, -1, 2], [1, 0, 1, 0], [0, 0, 0, -2], [0, 3, 0, 0], [0, 0, 1, 0], [0, 1, 2, 1], [5, 0, 0, 2], [5, 4, 5, 0], [0, 3, -4, 3], [-2, 0, 0, -1], [2, 0, 0, -3], [0, -2, 6, -2], [1, -2, 1, 0], [1, -5, 1, 0], [0, -2, -2, -2], [2, 0, 2, 0], [2, 0, 0, 7], [12, 2, 12, 0], [0, 2, -3, 2], [-3, 0, 0, 10], [0, -3, 8, -3], [-7, 0, 0, -1], [2, -12, 2, 0], [0, -6, -10, -6], [0, 9, -1, 9], [-6, 3, -6, 0], [6, 0, 0, -3], [-3, 0, 0, 2], [0, 8, -7, 8], [6, -4, 6, 0], [-2, 0, 0, -7], [0, -6, -10, -6], [17, -4, 17, 0], [-4, 6, -4, 0], [0, -2, -8, -2], [6, 0, 0, 9], [0, -14, 4, -14], [16, -6, 16, 0], [-12, 0, 0, 6], [0, -10, -4, -10], [11, 9, 11, 0], [4, 0, 0, 2], [0, -6, 0, 0], [-8, 0, 0, 5], [15, 0, 0, -6], [-11, 7, -11, 0], [0, -14, 0, -14], [0, 2, -8, 2], [0, 0, 0, -20], [15, -11, 15, 0], [-21, 0, 0, 0], [0, 0, 6, 0], [-4, 11, -4, 0], [-1, 0, -1, 0], [0, 7, -1, 7], [18, -3, 18, 0], [10, 0, 0, 8], [-6, -11, -6, 0], [-23, 0, 0, 0], [6, 0, 0, -1], [-18, -3, -18, 0], [0, -2, -1, -2], [0, -6, -1, -6], [0, -13, 14, -13], [-5, 0, 0, -5], [34, 0, 34, 0], [-12, 0, 0, -3], [-24, 7, -24, 0], [0, 0, 10, 0], [-1, -3, -1, 0], [0, 6, -8, 6], [-8, 0, 0, -8], [0, 4, 10, 4], [-26, 2, -26, 0], [0, -2, -8, -2], [0, 10, 0, 10], [-21, -7, -21, 0], [-14, 0, 0, 12], [18, 0, 0, 2], [24, -7, 24, 0], [-28, 0, 0, 2], [0, 18, -3, 18], [0, -4, -9, -4], [10, 0, 0, -3], [0, 22, 5, 22], [-6, 0, 0, 8], [-4, 0, 0, -4], [0, 2, -18, 2], [10, -8, 10, 0], [19, 14, 19, 0], [5, 0, 0, 10], [0, 8, -2, 8], [14, 0, 0, 3], [0, -8, -3, -8], [-2, -24, -2, 0], [0, -7, 14, -7], [0, -13, -12, -13], [-2, 0, 0, -9], [-23, -1, -23, 0], [25, 7, 25, 0], [0, -16, 0, -16], [-2, -23, -2, 0], [-7, -6, -7, 0], [1, 0, 0, -16], [0, 26, -8, 26], [-34, -3, -34, 0], [-31, 0, 0, -1], [0, -14, 3, -14], [-10, 25, -10, 0], [-2, 0, 0, -23], [-14, 14, -14, 0], [9, 0, 0, 11], [20, -1, 20, 0], [38, 0, 0, -3], [-8, -25, -8, 0], [0, -15, -5, -15], [-14, 0, 0, -12], [-14, -13, -14, 0], [-15, 0, 0, -9], [0, -8, -11, -8], [-27, -3, -27, 0], [0, -11, 36, -11], [17, 0, 0, -17], [0, -13, -32, -13], [0, 2, 6, 2], [31, 0, 0, -9], [0, 27, -4, 27], [-18, -11, -18, 0], [2, 0, 0, 36], [0, -22, 15, -22], [-20, 0, 0, -15], [0, 10, -8, 10], [39, 0, 0, 4], [12, 16, 12, 0], [-30, 8, -30, 0], [-9, 0, 0, 0], [24, 19, 24, 0], [-12, 0, 0, -11], [0, 27, -7, 27], [4, -20, 4, 0], [15, 0, 0, -9], [32, 12, 32, 0], [32, 0, 0, -15], [8, 0, 0, -35], [30, -8, 30, 0], [0, -30, -6, -30], [0, 3, 34, 3], [0, 9, 28, 9], [10, 0, 0, 24], [20, 0, 0, -19], [0, -5, -44, -5], [-26, 7, -26, 0], [-26, 0, 0, 2], [0, 4, -46, 4], [0, 5, -10, 5], [15, 0, 0, 10], [15, 8, 15, 0], [0, -4, -26, -4], [42, 0, 0, 2], [-15, 0, 0, 11], [0, 17, 13, 17], [2, 0, 2, 0], [-32, -12, -32, 0], [-11, 16, -11, 0], [-6, 2, -6, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_798_j_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_798_2_j_h();".
// 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_798_2_j_h(:prec:=4)
    chi := MakeCharacter_798_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_798_2_j_h();".
// 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_798_2_j_h( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_798_j();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<5,R![49, -42, 29, -6, 1]>,<11,R![1, -1, 1]>,<13,R![-8, 0, 1]>],Snew);
    return Vf;
end function;