
// Make newform 9216.2.a.n in Magma, downloaded from the LMFDB on 20 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_9216_a();"
// To make the coeffs of the qexp of the newform in the Hecke field type "qexpCoeffs();"
// To make the newform (type ModFrm), type "MakeNewformModFrm_9216_2_a_n();".
// 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_9216_2_a_n();".
// 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 := [-2, 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_9216_a();"
function MakeCharacter_9216_a()
    N := 9216;
    order := 1;
    char_gens := [8191, 2053, 4097];
    v := [1, 1, 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;

function MakeCharacter_9216_a_Hecke(Kf)
    return MakeCharacter_9216_a();
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, 0], [0, 1], [0, 0], [0, -1], [6, 0], [-6, 0], [0, 6], [0, -6], [0, -1], [0, -5], [6, 0], [-6, 0], [0, -6], [0, 6], [0, 0], [0, 5], [4, 0], [0, -6], [0, 0], [0, -1], [-12, 0], [-6, 0], [-12, 0], [0, -6], [0, -7], [-12, 0], [0, 13], [6, 0], [0, 7], [12, 0], [18, 0], [4, 0], [0, 12], [0, 13], [0, -5], [-6, 0], [0, 12], [0, -12], [-24, 0], [0, -11], [0, -12], [-14, 0], [0, 6], [0, 7], [4, 0], [0, -19], [-12, 0], [0, -1], [6, 0], [0, -12], [10, 0], [-24, 0], [6, 0], [0, 0], [0, 6], [0, -19], [0, 11], [18, 0], [-4, 0], [0, 6], [-20, 0], [0, 12], [10, 0], [0, 6], [-28, 0], [-24, 0], [-12, 0], [0, 19], [-18, 0], [0, 18], [0, 23], [0, -5], [-30, 0], [0, -24], [0, 12], [0, 7], [-6, 0], [12, 0], [-36, 0], [0, 11], [0, -6], [-24, 0], [0, -5], [-12, 0], [-18, 0], [-12, 0], [0, 24], [0, -5], [12, 0], [0, 6], [0, -13], [24, 0], [-4, 0], [0, 6], [0, 18], [-30, 0], [18, 0], [0, -25], [-18, 0], [0, -12], [0, 0], [-18, 0], [4, 0], [36, 0], [0, 0], [-18, 0], [0, -18], [12, 0], [0, -17], [0, 19], [-6, 0], [-28, 0], [0, -13], [42, 0], [-18, 0], [0, 6], [0, -12], [0, 0], [0, -7], [-24, 0], [0, 0], [-36, 0], [42, 0], [0, 18], [0, 1], [0, 6], [0, 23], [0, -35], [-20, 0], [0, 12], [0, -35], [0, 1], [6, 0], [14, 0], [0, -18], [-18, 0], [0, -12], [18, 0], [6, 0], [0, -6], [0, 23], [12, 0], [0, -11], [0, -18], [0, 31], [-42, 0], [6, 0], [0, 0], [0, 5], [-18, 0], [-30, 0], [0, -12], [6, 0], [0, 12], [0, -1], [-6, 0], [2, 0], [0, 36], [-24, 0], [-6, 0], [0, 29], [60, 0], [-6, 0], [0, 24], [0, 37], [0, -41], [-36, 0], [0, -24], [24, 0], [0, 29], [0, -36], [-26, 0], [0, 1], [-6, 0], [44, 0], [0, -24], [0, -5], [0, -17], [0, -25], [-12, 0], [0, -11], [42, 0], [0, 24], [0, 36], [0, -37], [44, 0], [14, 0], [0, 24], [-2, 0], [-48, 0], [-52, 0], [0, -36], [60, 0], [18, 0], [-12, 0], [0, 35], [-30, 0], [0, -12], [0, -12], [0, -7], [0, 1], [0, 0], [24, 0], [0, -6], [0, 41], [24, 0], [6, 0], [30, 0], [-34, 0], [0, 48], [0, -5], [48, 0], [0, -30], [0, 0], [0, -13], [-6, 0], [0, 0], [0, 0], [0, 1], [0, 7], [30, 0], [0, 31], [36, 0], [0, 7], [66, 0], [0, -6], [0, -7], [48, 0], [0, 13], [-42, 0], [0, -5], [66, 0], [-66, 0], [0, -30], [12, 0], [0, 48], [-36, 0], [0, -6], [-24, 0], [-52, 0], [0, -25], [0, 53], [66, 0], [0, -54], [0, 25], [60, 0], [68, 0], [0, 48], [0, 11], [78, 0], [0, 42], [26, 0], [0, -6], [-36, 0], [0, -1], [28, 0], [0, 18], [48, 0], [0, -19], [48, 0], [0, -25], [0, 5], [30, 0], [-28, 0], [0, -48], [6, 0], [30, 0], [0, -24], [0, 19], [52, 0], [-26, 0], [0, 25], [-50, 0], [0, -17], [48, 0], [0, -17], [-60, 0], [60, 0], [0, -30], [0, 19], [0, -6], [0, -5], [54, 0], [0, -12], [34, 0], [0, -24], [0, -23], [-42, 0], [0, -24], [72, 0], [66, 0], [24, 0], [0, -31], [0, -36], [0, 19], [0, -42], [-48, 0], [78, 0], [-58, 0], [0, 24], [0, 25], [60, 0], [66, 0], [34, 0], [48, 0], [0, -11], [0, -18], [0, -43], [0, 36], [0, 18], [66, 0], [42, 0], [0, -24], [70, 0], [48, 0], [0, 54], [24, 0], [-54, 0], [-28, 0], [-58, 0], [0, -42], [0, 23], [6, 0], [-12, 0], [-54, 0], [18, 0], [0, 12], [0, 12], [0, -13], [0, 12], [0, -19], [-60, 0], [-20, 0], [-72, 0], [0, 53], [-30, 0], [-48, 0], [0, 19], [0, 17], [90, 0], [0, 42], [0, 17], [0, 6], [-72, 0], [0, 37], [44, 0], [0, 6], [0, -42], [30, 0], [84, 0], [0, 54], [0, 41], [0, -7], [54, 0], [0, -24], [24, 0], [-6, 0], [0, -12], [0, 43], [-78, 0], [0, 0], [24, 0], [-20, 0], [12, 0], [0, 6], [0, -59], [24, 0], [48, 0], [-78, 0], [0, 12], [0, -6], [0, -1], [0, 13], [24, 0], [0, 24], [-2, 0], [-90, 0], [-82, 0], [0, 24], [30, 0], [0, 13], [-18, 0], [6, 0], [0, -48], [0, -59], [0, 59], [-20, 0], [0, -42], [46, 0], [0, -36], [-84, 0], [42, 0], [0, 12], [36, 0], [0, 29], [-30, 0], [-6, 0], [0, 0], [0, 17], [6, 0], [0, -53], [6, 0], [0, -42], [0, -47], [0, 35], [-30, 0], [18, 0], [48, 0], [12, 0], [0, 60], [48, 0], [18, 0], [-24, 0], [0, 18], [0, 48], [0, -35], [-102, 0], [0, -18], [0, 12], [0, -7], [0, -12], [-12, 0], [-38, 0], [0, 30], [-12, 0], [-6, 0], [-90, 0], [0, 6], [-14, 0], [-36, 0], [-54, 0], [0, 30], [0, -31], [-54, 0], [72, 0], [0, 31], [18, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_9216_a_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_9216_2_a_n();".
// 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_9216_2_a_n(:prec:=2)
    chi := MakeCharacter_9216_a();
    f_vec := qexpCoeffs();
    Kf := Universe(f_vec);
    // SetVerbose("ModularForms", true);
    // SetVerbose("ModularSymbols", true);
    S := CuspidalSubspace(ModularForms(chi, 2));
    S := BaseChange(S, Kf);
    maxprec := NextPrime(3067) - 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_9216_2_a_n();".
// 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_9216_2_a_n( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_9216_a();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<5,R![0, 1]>,<7,R![-2, 0, 1]>,<11,R![0, 1]>,<13,R![-2, 0, 1]>,<17,R![-6, 1]>,<19,R![6, 1]>,<67,R![-4, 1]>],Snew);
    return Vf;
end function;