
// Make newform 2496.2.a.a in Magma, downloaded from the LMFDB on 20 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_2496_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_2496_2_a_a();".
// 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_2496_2_a_a();".
// 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
        Kf := Rationals();
    end if;
    return [Kf!elt[1] : elt in input];
end function;


// To make the character of type GrpDrchElt, type "MakeCharacter_2496_a();"
function MakeCharacter_2496_a()
    N := 2496;
    order := 1;
    char_gens := [703, 1093, 833, 769];
    v := [1, 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_2496_a_Hecke(Kf)
    return MakeCharacter_2496_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], [-1], [-4], [0], [-2], [1], [2], [8], [-4], [6], [4], [-6], [-12], [4], [6], [2], [-14], [-10], [-4], [-2], [-2], [8], [14], [0], [-10], [6], [8], [0], [-10], [-18], [8], [8], [-12], [-12], [16], [-20], [2], [24], [-18], [-18], [-12], [-6], [0], [26], [-12], [8], [-20], [-28], [-6], [-10], [-2], [-2], [-18], [8], [14], [20], [-26], [-8], [2], [20], [20], [0], [-12], [12], [6], [12], [-28], [30], [-12], [-6], [-28], [30], [8], [-26], [-16], [-30], [26], [10], [0], [6], [-24], [-26], [-14], [-2], [0], [8], [-8], [-10], [-28], [16], [0], [-14], [-28], [0], [36], [-36], [-12], [-10], [-20], [6], [-4], [8], [4], [-2], [12], [2], [22], [-8], [12], [22], [40], [-14], [12], [28], [20], [-14], [-36], [-32], [6], [-12], [-38], [-14], [26], [-2], [20], [-6], [-2], [20], [24], [-2], [-28], [-34], [48], [22], [20], [26], [48], [-44], [2], [-10], [-8], [-24], [16], [-10], [-34], [-30], [-38], [30], [-36], [2], [42], [38], [44], [-32], [-20], [-16], [-16], [20], [-18], [-48], [42], [6], [28], [-60], [0], [-30], [32], [26], [-34], [-34], [42], [-54], [-20], [-26], [-56], [2], [-4], [48], [-40], [-50], [-8], [20], [6], [24], [30], [-6], [2], [0], [-50], [30], [58], [6], [-20], [32], [12], [-10], [-14], [14], [-64], [24], [-44], [16], [46], [-38], [-30], [-54], [-68], [48], [8], [-68], [30], [18], [8], [14], [10], [2], [-56], [10], [6], [0], [-38], [-72], [24], [-44], [0], [58], [-30], [12], [24], [34], [-30], [4], [-8], [10], [-12], [-2], [14], [32], [68], [56], [54], [20], [-16], [-46], [0], [-20], [56], [42], [16], [52], [6], [36], [-14], [-26], [30], [-66], [22], [16], [42], [34], [8], [-12], [-34], [-30], [40], [68], [-20], [20], [-4], [-26], [14], [-52], [-26], [-16], [-50], [40], [-6], [34], [-14], [-32], [32], [-16], [-40], [34], [68], [32], [-34], [48], [52], [-34], [50], [-36], [-32], [-54], [18], [-70], [64], [42], [60], [20], [26], [28], [-32], [76], [36], [-58], [60], [34], [-62], [-2], [-36], [-60], [-10], [-68], [-58], [86], [-30], [42], [-34], [-6], [-44], [58], [-14], [68], [-8], [-66], [24], [84], [32], [54], [62], [78], [48], [30], [48], [-42], [2], [60], [-10], [0], [-70], [6], [48], [-48], [44], [4], [6], [-32], [-42], [58], [-36], [62], [8], [-24], [70], [-34], [14], [74], [70], [42], [-62], [18], [12], [26], [28], [-6], [-36], [-4], [58], [56], [-12], [-2], [-22], [-64], [34], [6], [72], [34], [-6], [-70], [-72], [44], [-48], [-24], [-8], [42], [0], [22], [-56], [60], [46], [-16], [-42], [36], [-42], [-26], [0], [-78], [-4], [92], [34], [90], [80], [32], [-52], [-88], [14], [0], [44], [-90], [50], [26], [-76], [-20], [18], [-46], [54], [-8], [72], [-92], [70], [-62], [-26], [-88], [82], [88], [-56], [-48], [0], [80]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_2496_a_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_2496_2_a_a();".
// 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_2496_2_a_a(:prec:=1)
    chi := MakeCharacter_2496_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(2999) - 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_2496_2_a_a();".
// 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_2496_2_a_a( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_2496_a();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<5,R![4, 1]>,<7,R![0, 1]>,<11,R![2, 1]>,<17,R![-2, 1]>,<19,R![-8, 1]>],Snew);
    return Vf;
end function;