
// Make newform 3024.2.b.i in Magma, downloaded from the LMFDB on 24 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_3024_b();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_3024_b_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_3024_2_b_i();".
// 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_3024_2_b_i();".
// 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, -1, 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_3024_b();"
function MakeCharacter_3024_b()
    N := 3024;
    order := 2;
    char_gens := [1135, 757, 785, 2593];
    v := [1, 2, 2, 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_3024_b_Hecke();"
function MakeCharacter_3024_b_Hecke(Kf)
    N := 3024;
    order := 2;
    char_gens := [1135, 757, 785, 2593];
    char_values := [[-1, 0], [1, 0], [1, 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+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], [1, -2], [2, -3], [-3, 6], [-2, 4], [2, -4], [-8, 0], [4, -8], [-6, 0], [5, 0], [4, 0], [4, -8], [2, -4], [-6, 0], [-3, 0], [-12, 0], [8, -16], [-2, 4], [-2, 4], [1, -2], [2, -4], [-15, 0], [6, -12], [-5, 10], [-5, 10], [-16, 0], [-5, 10], [20, 0], [-12, 0], [-7, 14], [-15, 0], [6, 0], [8, 0], [-21, 0], [-7, 14], [-4, 8], [-6, 12], [6, 0], [1, -2], [11, -22], [12, -24], [-6, 12], [-5, 0], [27, 0], [-11, 0], [8, -16], [-8, 0], [-12, 0], [2, -4], [6, 0], [4, -8], [12, -24], [12, 0], [14, -28], [8, -16], [-8, 16], [17, 0], [-8, 0], [-6, 0], [4, 0], [0, 0], [-14, 0], [0, 0], [-9, 18], [-3, 0], [14, -28], [-10, 0], [15, -30], [0, 0], [-4, 8], [2, -4], [13, 0], [-22, 0], [0, 0], [-18, 0], [-3, 0], [-2, 4], [24, 0], [-9, 18], [36, 0], [-20, 0], [-10, 20], [-13, 26], [7, 0], [10, -20], [24, 0], [17, 0], [3, -6], [7, -14], [27, 0], [18, 0], [2, -4], [13, -26], [-18, 36], [12, 0], [5, -10], [-18, 36], [2, 0], [16, 0], [14, -28], [-21, 0], [-21, 0], [-36, 0], [-6, 12], [20, -40], [39, 0], [18, -36], [-22, 44], [11, -22], [28, 0], [2, 0], [-36, 0], [-10, 0], [-3, 6], [-24, 0], [28, 0], [36, 0], [27, 0], [11, -22], [-8, 16], [1, 0], [-24, 48], [-10, 20], [-40, 0], [-39, 0], [32, 0], [12, 0], [29, 0], [-4, 8], [26, -52], [-6, 12], [15, -30], [2, 0], [-8, 16], [-23, 46], [-28, 56], [-40, 0], [11, -22], [54, 0], [-28, 0], [42, 0], [17, -34], [6, -12], [-2, 4], [30, 0], [10, -20], [-26, 52], [-8, 0], [0, 0], [26, 0], [26, -52], [20, -40], [-18, 0], [4, -8], [6, -12], [3, -6], [4, -8], [-15, 30], [-15, 30], [11, -22], [-36, 0], [31, -62], [27, 0], [-18, 0], [-18, 0], [25, -50], [30, -60], [1, 0], [8, -16], [-17, 34], [-18, 36], [18, -36], [-62, 0], [-41, 0], [8, -16], [4, -8], [63, 0], [35, 0], [22, -44], [9, -18], [15, 0], [28, 0], [0, 0], [6, -12], [-19, 38], [20, 0], [38, 0], [-23, 0], [36, 0], [4, -8], [-21, 42], [-18, 36], [15, -30], [2, -4], [-12, 24], [31, 0], [46, 0], [36, -72], [-36, 0], [-27, 0], [-17, 0], [-22, 44], [-25, 50], [-27, 0], [4, -8], [-56, 0], [35, -70], [30, 0], [10, 0], [-43, 0], [8, -16], [-31, 62], [45, 0], [-12, 0], [11, -22], [14, -28], [10, -20], [-26, 52], [6, 0], [68, 0], [8, 0], [-24, 0], [-10, 20], [21, 0], [40, 0], [16, -32], [-12, 24], [56, 0], [22, -44], [-10, 0], [-56, 0], [-2, 4], [-60, 0], [-26, 0], [-12, 0], [-16, 32], [6, 0], [-23, 46], [24, 0], [-30, 60], [-34, 0], [49, 0], [-62, 0], [34, -68], [-66, 0], [47, 0], [3, 0], [-28, 56], [-30, 60], [44, 0], [-22, 44], [-26, 52], [13, -26], [45, -90], [9, -18], [-2, 0], [-44, 0], [-1, 2], [-35, 70], [-11, 22], [-11, 22], [38, -76], [18, -36], [-20, 40], [44, 0], [30, 0], [4, -8], [-22, 44], [-6, 0], [18, -36], [36, -72], [23, -46], [-13, 26], [43, -86], [29, 0], [-27, 54], [10, 0], [-35, 0], [0, 0], [-24, 0], [1, -2], [-12, 0], [-20, 40], [38, 0], [46, -92], [65, 0], [21, 0], [-64, 0], [-28, 56], [-30, 0], [-27, 0], [36, 0], [-21, 0], [-64, 0], [12, -24], [73, 0], [15, -30], [27, 0], [-82, 0], [-28, 56], [45, 0], [43, -86]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_3024_b_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_3024_2_b_i();".
// 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_3024_2_b_i(:prec:=2)
    chi := MakeCharacter_3024_b();
    f_vec := qexpCoeffs();
    Kf := Universe(f_vec);
    // SetVerbose("ModularForms", true);
    // SetVerbose("ModularSymbols", true);
    S := CuspidalSubspace(ModularForms(chi, 2));
    S := BaseChange(S, Kf);
    maxprec := NextPrime(1999) - 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_3024_2_b_i();".
// 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_3024_2_b_i( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_3024_b();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<5,R![3, 0, 1]>,<11,R![27, 0, 1]>,<13,R![12, 0, 1]>,<17,R![12, 0, 1]>,<19,R![8, 1]>,<29,R![6, 1]>,<47,R![6, 1]>],Snew);
    return Vf;
end function;