
// Make newform 153.2.e.a in Magma, downloaded from the LMFDB on 19 September 2025.
// To make the character of type GrpDrchElt, type "MakeCharacter_153_e();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_153_e_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_153_2_e_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_153_2_e_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 := [1, 1, 2, -1, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0], [0, 1, 0, 0], [1, 0, 0, 1], [-1, -2, 2, -1]];
    Rf_basisdens := [1, 1, 2, 2];
    Rf_basisnums := ChangeUniverse([[z : z in elt] : elt in Rf_num], Kf);
    Rfbasis := [Rf_basisnums[i]/Rf_basisdens[i] : i in [1..Degree(Kf)]];
    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_153_e();"
function MakeCharacter_153_e()
    N := 153;
    order := 3;
    char_gens := [137, 37];
    v := [2, 3];
    // 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_153_e_Hecke();"
function MakeCharacter_153_e_Hecke( : Kf := false)
    N := 153;
    order := 3;
    char_gens := [137, 37];
    char_values := [[0, 0, 0, 1], [1, 0, 0, 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 := 2;
    raw_aps := [[0, -1, 0, 0], [1, 0, 0, 2], [0, 2, 2, -1], [3, 0, 0, 3], [-1, 4, 0, -1], [0, -4, -4, 3], [-1, 0, 0, 0], [0, 0, 0, 0], [0, -4, -4, -1], [-7, 2, 0, -7], [0, 8, 8, -5], [-6, 0, -4, 0], [0, -2, -2, 7], [3, -6, 0, 3], [3, -2, 0, 3], [-2, 0, -8, 0], [0, -2, -2, -5], [5, -2, 0, 5], [0, -6, -6, -5], [8, 0, -4, 0], [-2, 0, 4, 0], [3, 0, 0, 3], [3, 2, 0, 3], [2, 0, 4, 0], [-7, 10, 0, -7], [13, -8, 0, 13], [0, -6, -6, 3], [0, 0, 0, 0], [6, 0, 4, 0], [0, 2, 2, 3], [-8, 0, 4, 0], [0, -8, -8, 7], [5, -8, 0, 5], [0, 8, 8, -9], [0, 8, 8, -5], [19, -6, 0, 19], [0, 0, 0, -13], [-4, 0, 8, 0], [0, 4, 4, -13], [1, 2, 0, 1], [-12, 0, -4, 0], [-6, 0, 0, 0], [-1, 2, 0, -1], [0, -2, -2, 3], [-18, 0, -16, 0], [16, 0, 12, 0], [0, -12, -12, -5], [27, -2, 0, 27], [-9, -12, 0, -9], [0, 12, 12, -9], [-26, 0, -4, 0], [0, -2, -2, -1], [-15, -6, 0, -15], [-12, 0, 8, 0], [0, 0, 0, 15], [3, -2, 0, 3], [14, 0, -4, 0], [4, 0, -8, 0], [-15, -6, 0, -15], [17, -16, 0, 17], [0, 24, 24, -9], [0, -8, -8, 7], [-12, 0, -20, 0], [0, 12, 12, -9], [1, -10, 0, 1], [-15, 6, 0, -15], [-13, -2, 0, -13], [0, -6, -6, -13], [0, 20, 20, -9], [-3, 8, 0, -3], [-11, 16, 0, -11], [-4, 0, 16, 0], [3, 20, 0, 3], [0, -4, -4, -17], [-12, 0, -12, 0], [0, -10, -10, -5], [-3, -4, 0, -3], [2, 0, 24, 0], [0, -2, -2, 31], [0, 0, 0, 11], [0, -16, -16, 19], [-15, 16, 0, -15], [36, 0, 0, 0], [-14, 0, -12, 0], [-9, 4, 0, -9], [-5, 10, 0, -5], [-30, 0, -12, 0], [-19, 4, 0, -19], [-19, 20, 0, -19], [0, -22, -22, 15], [12, 0, 0, 0], [15, -20, 0, 15], [-4, 0, -12, 0], [0, -6, -6, -9], [0, -24, -24, -5], [0, 0, -4, 0], [0, -8, -8, 7], [-6, 0, 8, 0], [-8, 0, 12, 0], [-6, 0, -12, 0], [-1, -12, 0, -1], [-6, 0, -16, 0], [0, -2, -2, -5], [-23, 8, 0, -23], [0, -12, -12, -9], [18, 0, 12, 0], [15, 14, 0, 15], [10, 0, 32, 0], [0, 38, 38, -25], [-7, 22, 0, -7], [0, 0, 0, -9], [-14, 0, 0, 0], [0, -2, -2, 7], [-17, 0, 0, -17], [16, 0, -12, 0], [13, -22, 0, 13], [0, -8, -8, 15], [-24, 0, -36, 0], [0, -2, -2, -9], [-25, 10, 0, -25], [0, 0, 0, 3], [21, -6, 0, 21], [-3, -30, 0, -3], [16, 0, -16, 0], [27, -20, 0, 27], [18, 0, 24, 0], [29, -6, 0, 29], [-28, 0, -8, 0], [35, -18, 0, 35], [0, -8, -8, -25], [-16, 0, 12, 0], [0, 28, 28, -5], [0, 12, 12, -37], [-22, 0, 12, 0], [0, 8, 8, -1], [0, -16, -16, 27], [30, 0, 36, 0], [0, 8, 8, 39], [0, 4, 4, -13], [30, 0, 12, 0], [-12, 0, -24, 0], [21, -14, 0, 21], [0, 4, 4, -9], [0, 0, 12, 0], [14, 0, -4, 0], [15, -12, 0, 15], [25, -18, 0, 25], [-15, 6, 0, -15], [0, 6, 6, 15], [8, 0, 16, 0], [0, -6, -6, 11], [6, 0, 4, 0], [-12, 0, 0, 0], [0, 4, 4, 27], [-41, 20, 0, -41], [-33, 40, 0, -33], [24, 0, 24, 0], [9, 14, 0, 9], [-22, 0, 0, 0], [0, -18, -18, 39], [39, -12, 0, 39], [26, 0, 16, 0], [0, 26, 26, -21], [24, 0, -4, 0], [0, -4, -4, 23], [19, -32, 0, 19], [-12, 0, 0, 0], [-11, 18, 0, -11]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_153_e_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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