
// Make newform 24.4.f.a in Magma, downloaded from the LMFDB on 26 December 2025.
// To make the character of type GrpDrchElt, type "MakeCharacter_24_f();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_24_f_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_24_4_f_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_24_4_f_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
        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_24_f();"
function MakeCharacter_24_f()
    N := 24;
    order := 2;
    char_gens := [7, 13, 17];
    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;

// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_24_f_Hecke();"
function MakeCharacter_24_f_Hecke( : Kf := false)
    N := 24;
    order := 2;
    char_gens := [7, 13, 17];
    char_values := [[-1, 0], [-1, 0], [-1, 0]];
    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 := 4;
    raw_aps := [[0, 2], [5, 1], [0, 0], [0, 0], [0, -50], [0, 0], [0, 76], [-106, 0], [0, 0], [0, 0], [0, 0], [0, 0], [0, 40], [290, 0], [0, 0], [0, 0], [0, -230], [0, 0], [-70, 0], [0, 0], [-430, 0], [0, 0], [0, -482], [0, 940], [1910, 0], [0, 0], [0, 0], [0, 994], [0, 0], [0, -1688], [0, 0], [0, 1930], [0, -1616], [-1474, 0], [0, 0], [0, 0], [0, 0], [-970, 0], [0, 0], [0, 0], [0, -2030], [0, 0], [0, 0], [2090, 0], [0, 0], [0, 0], [-6118, 0], [0, 0], [0, -1346], [0, 0], [0, 2668], [0, 0], [-1222, 0], [0, -4730], [0, -5144], [0, 0], [0, 0], [0, 0], [0, 0], [0, -860], [8030, 0], [0, 0], [-7990, 0], [0, 0], [8390, 0], [0, 0], [-8242, 0], [-11410, 0], [0, 8086], [0, 0], [0, 8752], [0, 0], [0, 0], [0, 0], [11666, 0], [0, 0], [0, 0], [0, 0], [0, -10220], [16346, 0], [0, 2470], [0, 0], [0, 0], [5510, 0], [0, 0], [0, -2642], [0, 5260], [-18070, 0], [0, 0], [0, 0], [0, 9526], [0, 0], [0, 0], [0, 12730], [-18214, 0], [0, 0], [0, 0], [0, 15520], [-4750, 0], [0, 0], [-21850, 0], [0, 0], [0, -8762], [0, 19120], [27038, 0], [19550, 0], [0, -18734], [0, 8608], [0, 0], [-14398, 0], [0, 0], [0, 0], [0, 7924], [-30706, 0], [0, 0], [0, -22460], [28550, 0], [0, 0], [0, 0], [0, -11390], [0, 0], [19190, 0], [0, 0], [0, 23782], [-1978, 0], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0], [36074, 0], [0, 0], [0, 0], [0, 0], [0, -17240], [40106, 0], [0, 0], [6950, 0], [0, 0], [0, -30920], [-37582, 0], [0, 0], [0, 0], [0, -29246], [0, 0], [0, 0], [0, 0], [0, 32944], [-45646, 0], [0, 0], [0, 0], [0, -22280], [-5290, 0], [0, 0], [26210, 0], [0, 0], [0, 0], [0, -39740], [56270, 0], [0, 0], [0, 1786], [0, -25952], [0, 0], [0, 42790], [0, 41404], [0, 0], [0, 0], [0, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_24_f_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_24_4_f_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_24_4_f_a(:prec:=2)
    chi := MakeCharacter_24_f();
    f_vec := qexpCoeffs();
    Kf := Universe(f_vec);
    // SetVerbose("ModularForms", true);
    // SetVerbose("ModularSymbols", true);
    S := CuspidalSubspace(ModularForms(chi, 4));
    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_24_4_f_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_24_4_f_a( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_24_f();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,4,sign)));
    Vf := Kernel([<5,R![0, 1]>],Snew);
    return Vf;
end function;