
// Make newform 3024.2.bf.d in Magma, downloaded from the LMFDB on 12 September 2025.
// To make the character of type GrpDrchElt, type "MakeCharacter_3024_bf();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_3024_bf_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_bf_d();".
// 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_bf_d();".
// 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_bf();"
function MakeCharacter_3024_bf()
    N := 3024;
    order := 6;
    char_gens := [1135, 757, 785, 2593];
    v := [3, 6, 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_bf_Hecke();"
function MakeCharacter_3024_bf_Hecke( : Kf := false)
    N := 3024;
    order := 6;
    char_gens := [1135, 757, 785, 2593];
    char_values := [[-1, 0], [1, 0], [-1, 1], [0, 1]];
    assert UnitGenerators(DirichletGroup(N)) eq char_gens;
    values := ConvertToHeckeField(char_values : pass_field := ISA(Type(Kf), Fld), 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], [1, -2], [3, -1], [-3, 6], [-3, -3], [-1, -1], [0, 1], [-1, 2], [0, 9], [0, 8], [0, 11], [1, 1], [10, -5], [12, -12], [-3, 3], [0, -12], [0, 0], [-4, 2], [2, -4], [-7, -7], [6, 6], [0, 9], [6, -3], [-2, 1], [-5, 10], [7, 0], [14, -7], [-5, 5], [15, -15], [6, -12], [-9, 0], [-3, 0], [5, -5], [3, 0], [-3, 6], [-8, 4], [10, -5], [-3, 3], [-8, -8], [13, 13], [0, 0], [-6, -6], [0, 14], [18, 0], [-11, 11], [7, 7], [0, 1], [-3, 0], [-13, 26], [0, -9], [-1, -1], [-17, 34], [-12, 0], [11, -22], [7, -14], [1, 1], [0, 11], [1, 0], [0, 15], [0, 4], [15, 15], [20, 0], [0, 24], [-12, -12], [-30, 30], [-10, -10], [1, -1], [-12, 6], [-22, 11], [-7, 14], [10, -5], [5, 0], [-31, 0], [-10, 20], [9, 0], [39, 0], [-18, 9], [-27, 0], [8, -4], [3, -3], [0, -25], [7, 7], [-4, 8], [16, -16], [-22, -22], [-18, 0], [10, -10], [-18, 9], [13, 13], [0, 3], [3, 0], [5, 5], [-7, -7], [23, -46], [-24, 0], [5, -10], [3, 3], [0, 29], [0, -25], [-30, 15], [-3, 3], [0, -24], [-18, 18], [-12, 6], [-7, -7], [0, -3], [6, -3], [4, -2], [30, -15], [35, 0], [-41, 41], [3, -3], [-17, 0], [14, -28], [-15, 0], [-23, 23], [-45, 45], [27, 0], [-2, 1], [32, -16], [0, -19], [-12, -12], [13, 13], [-40, 40], [-30, 0], [-14, 14], [0, 21], [0, -19], [15, -30], [-9, -9], [27, 27], [9, -18], [-22, 0], [19, -38], [-13, -13], [-31, -31], [0, -28], [-13, -13], [51, -51], [28, 0], [-6, 6], [4, -2], [18, -36], [-13, -13], [0, -9], [26, -13], [13, -26], [41, 0], [-6, 3], [-31, 0], [-28, 56], [14, -28], [45, 0], [-21, 42], [-54, 27], [22, -11], [-20, -20], [-20, 40], [0, 0], [10, 10], [18, 0], [-19, -19], [0, 27], [0, -42], [3, 0], [5, 5], [13, -26], [-26, 0], [29, -58], [-7, 14], [-15, -15], [3, -6], [19, 0], [0, -8], [17, 17], [66, -33], [-27, 27], [-8, 0], [16, 16], [-18, -18], [0, 45], [-13, 13], [-42, 21], [-36, 18], [-25, 50], [-5, 5], [-29, 0], [55, 0], [39, -39], [2, -1], [6, -3], [50, -25], [-24, -24], [-23, -23], [-24, 12], [0, -22], [-46, 46], [66, -33], [0, 33], [0, -30], [0, -11], [35, -70], [3, -6], [12, 0], [13, 13], [0, 7], [37, -74], [0, -69], [0, 4], [0, -71], [35, 35], [-18, 9], [36, -36], [0, 0], [-28, -28], [-28, 14], [25, -50], [74, -37], [-39, 39], [-55, 0], [23, -23], [-51, 0], [-10, 5], [39, -39], [0, -13], [40, 40], [3, 3], [56, -56], [26, 26], [0, 46], [43, -43], [-7, -7], [0, 54], [0, -5], [3, 0], [1, -2], [0, 9], [-31, -31], [-24, 0], [33, -66], [0, -43], [0, 4], [0, -61], [1, 1], [-24, 24], [-32, 0], [0, -12], [20, -10], [6, -12], [-41, 41], [-82, 41], [-52, 26], [-74, 37], [-9, 18], [-42, 21], [47, -47], [47, 0], [8, -16], [-70, 35], [1, -2], [-82, 41], [8, -4], [-16, 32], [-8, 4], [20, -20], [-6, 0], [-14, 7], [35, 35], [0, -54], [27, -54], [-37, -37], [-21, 42], [-35, 70], [-13, -13], [0, -13], [45, -90], [25, 0], [0, 17], [12, -12], [0, 60], [36, -18], [0, 63], [-38, 19], [-59, 0], [-22, 11], [49, -49], [45, -45], [1, 0], [-4, 8], [27, 0], [-15, 15], [-3, 0], [87, -87], [0, -5], [-48, 24], [-56, 56], [78, -39], [0, 63], [0, 47], [-43, 86], [0, 33], [1, 1]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_3024_bf_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_3024_2_bf_d();".
// 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_bf_d(:prec:=2)
    chi := MakeCharacter_3024_bf();
    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_bf_d();".
// 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_bf_d( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_3024_bf();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<5,R![3, 0, 1]>,<19,R![1, -1, 1]>],Snew);
    return Vf;
end function;