
// Make newform 980.2.q.c in Magma, downloaded from the LMFDB on 16 November 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_980_q();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_980_q_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_980_2_q_c();".
// 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_980_2_q_c();".
// 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, 0, -1, 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_980_q();"
function MakeCharacter_980_q()
    N := 980;
    order := 6;
    char_gens := [491, 197, 101];
    v := [6, 3, 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_980_q_Hecke();"
function MakeCharacter_980_q_Hecke(Kf)
    N := 980;
    order := 6;
    char_gens := [491, 197, 101];
    char_values := [[1, 0, 0, 0], [-1, 0, 0, 0], [0, 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]];
    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, 3, 0, 0], [0, -1, -2, 1], [0, 0, 0, 0], [-3, 0, 3, 0], [0, 0, 0, -1], [0, 5, 0, 0], [0, 0, 8, 0], [0, 2, 0, -2], [1, 0, 0, 0], [-2, 0, 2, 0], [0, -10, 0, 10], [6, 0, 0, 0], [0, 0, 0, -4], [0, 11, 0, -11], [0, -6, 0, 0], [10, 0, -10, 0], [0, 0, 0, 0], [0, -10, 0, 0], [0, 0, 0, 0], [0, -10, 0, 0], [0, 0, -7, 0], [0, 0, 0, -12], [0, 0, -8, 0], [0, 0, 0, 3], [-12, 0, 12, 0], [0, 5, 0, -5], [0, -8, 0, 8], [-7, 0, 7, 0], [0, 0, 0, -10], [0, 0, 0, 2], [0, 0, 2, 0], [0, 4, 0, 0], [10, 0, 0, 0], [0, 0, -6, 0], [-9, 0, 9, 0], [0, 18, 0, 0], [0, 6, 0, -6], [0, 0, 0, 3], [0, 9, 0, -9], [4, 0, -4, 0], [10, 0, 0, 0], [0, 0, -7, 0], [0, -8, 0, 0], [0, 0, 0, -10], [-18, 0, 18, 0], [-3, 0, 0, 0], [0, 0, 0, -19], [0, -27, 0, 0], [0, 0, 26, 0], [0, 16, 0, -16], [-5, 0, 0, 0], [-18, 0, 18, 0], [-2, 0, 0, 0], [0, 6, 0, -6], [0, 24, 0, 0], [-2, 0, 2, 0], [0, 0, 0, 0], [0, -14, 0, 0], [15, 0, 0, 0], [0, -7, 0, 0], [0, 0, 0, -15], [0, 0, 0, -19], [12, 0, -12, 0], [0, 7, 0, -7], [0, -28, 0, 28], [0, 0, -20, 0], [0, 0, 0, -22], [0, 18, 0, 0], [36, 0, 0, 0], [0, -9, 0, 0], [0, 0, 28, 0], [0, -19, 0, 0], [0, 32, 0, -32], [-28, 0, 0, 0], [0, 0, 0, 0], [9, 0, -9, 0], [0, -17, 0, 17], [0, 0, 27, 0], [-4, 0, 4, 0], [2, 0, 0, 0], [-23, 0, 0, 0], [37, 0, -37, 0], [0, 0, 0, 38], [0, 0, -26, 0], [0, 12, 0, -12], [-11, 0, 0, 0], [0, 22, 0, -22], [-28, 0, 0, 0], [0, 0, 0, 4], [0, -23, 0, 23], [18, 0, -18, 0], [0, -26, 0, 0], [33, 0, 0, 0], [0, 0, -29, 0], [0, 0, 0, -1], [0, 0, -26, 0], [12, 0, -12, 0], [0, 20, 0, -20], [0, 0, 25, 0], [0, 0, 0, 8], [0, 20, 0, 0], [0, -16, 0, 0], [0, 0, 18, 0], [-20, 0, 20, 0], [0, -17, 0, 0], [0, 0, 0, 28], [0, 3, 0, -3], [-21, 0, 21, 0], [-8, 0, 0, 0], [0, 5, 0, -5], [0, 12, 0, 0], [0, 0, 0, 34], [2, 0, -2, 0], [15, 0, 0, 0], [26, 0, -26, 0], [0, 0, 0, 5], [0, 24, 0, 0], [0, 36, 0, -36], [-39, 0, 0, 0], [28, 0, -28, 0], [0, 0, 0, -16], [0, -11, 0, 11], [0, -40, 0, 0], [0, 0, 40, 0], [-25, 0, 0, 0], [0, 0, 15, 0], [0, 0, -2, 0], [0, 0, 0, 28], [0, -41, 0, 41], [-5, 0, 5, 0], [0, 0, 0, 30], [0, 0, -13, 0], [0, 0, 0, 48], [0, 0, -38, 0], [16, 0, 0, 0], [0, -27, 0, 0], [0, -3, 0, 0], [0, 0, 0, 43], [-11, 0, 11, 0], [-6, 0, 0, 0], [0, 0, -45, 0], [0, 18, 0, 0], [0, 0, 0, 22], [-34, 0, 34, 0], [-46, 0, 0, 0], [0, 0, 0, -26], [0, 22, 0, 0], [0, 0, -24, 0], [0, 46, 0, -46], [0, -40, 0, 40], [48, 0, 0, 0], [0, 0, 0, 4], [0, 12, 0, -12], [0, 38, 0, 0], [-52, 0, 0, 0], [0, 0, -55, 0], [0, 0, 18, 0], [0, 0, 0, 7], [-40, 0, 40, 0], [0, -6, 0, 6], [0, 0, 0, -42], [0, 0, 0, -8], [0, 0, 18, 0], [0, -60, 0, 0], [0, 13, 0, 0], [32, 0, -32, 0], [0, 53, 0, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_980_q_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_980_2_q_c();".
// 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_980_2_q_c(:prec:=4)
    chi := MakeCharacter_980_q();
    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_980_2_q_c();".
// 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_980_2_q_c( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_980_q();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<3,R![81, 0, -9, 0, 1]>,<11,R![9, 3, 1]>,<19,R![64, -8, 1]>],Snew);
    return Vf;
end function;