
// Make newform 129.2.a.d in Magma, downloaded from the LMFDB on 14 March 2026.
// To make the character of type GrpDrchElt, type "MakeCharacter_129_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_129_2_a_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_129_2_a_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 := [-2, -6, -1, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0], [0, 1, 0], [-4, -2, 1]];
    Rf_basisdens := [1, 1, 1];
    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_129_a();"
function MakeCharacter_129_a()
    N := 129;
    order := 1;
    char_gens := [44, 46];
    v := [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_129_a_Hecke( : Kf := Kf)
    return MakeCharacter_129_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]];
    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 := [[-1, 1, 0], [1, 0, 0], [-1, -1, 0], [1, 0, -1], [1, -1, 1], [3, 0, 0], [0, 0, -1], [-1, -2, -1], [4, 2, 3], [1, -1, 0], [-2, 2, 1], [0, 2, 2], [-6, 2, -1], [-1, 0, 0], [-1, -3, -4], [-2, 2, 1], [2, 0, -2], [-4, -2, 2], [-4, 4, 3], [6, 2, -2], [-6, 0, -2], [8, -2, -2], [-1, -1, 3], [-12, -2, 0], [-1, 2, -2], [2, 2, 1], [4, 0, 3], [-1, -1, -2], [-3, -2, 0], [-5, 3, 2], [2, -4, -3], [-4, 8, 4], [1, -7, 0], [6, -6, 1], [-4, -2, 2], [-4, 4, 2], [8, 6, 4], [1, 0, 5], [11, -1, -1], [-2, 4, -4], [-4, 2, 0], [-5, -2, -9], [18, -4, -2], [8, -2, -1], [-10, 6, 2], [4, 0, -6], [1, 0, -5], [-3, -2, 1], [6, 0, 6], [8, -2, -3], [7, 1, -2], [13, 1, -2], [12, 4, 4], [13, 1, 1], [1, -5, 6], [-4, -2, -8], [6, 8, 3], [-8, -2, -5], [2, -6, -2], [-6, -4, -1], [-4, 2, -7], [-2, 2, 6], [2, 0, 5], [9, -3, -1], [-2, 0, 2], [-10, 0, 5], [-11, 14, 3], [1, -6, -6], [6, 2, -10], [4, -4, 8], [14, 0, -3], [0, 6, 7], [-14, 4, -2], [18, -8, -2], [-4, 4, -7], [0, 6, 2], [7, -11, -6], [9, -16, -5], [20, -8, -1], [-2, 6, -2], [2, 4, -4], [-4, 8, -6], [13, -9, 1], [-8, 0, 6], [16, 2, 5], [11, -3, 4], [-3, 3, -8], [-4, 2, -2], [-8, -2, 4], [13, 2, 9], [-26, 6, 2], [-11, 7, 3], [-12, 2, 2], [-4, -10, 2], [-1, -10, -5], [-16, -2, 0], [8, -2, 1], [-11, 11, 4], [7, -2, -9], [0, -14, 1], [-4, 12, 5], [-16, -2, -3], [-24, 10, 5], [14, 4, 3], [15, 0, -1], [-4, -6, -8], [-4, -10, 4], [20, -2, 8], [-5, -13, -9], [-16, -10, -6], [25, -10, -1], [-2, 8, -8], [2, 6, 5], [-26, 0, 2], [20, 0, 10], [8, -2, 12], [16, -2, -6], [-10, 2, -8], [-13, -7, 6], [-4, -10, -11], [3, 6, 2], [-4, -14, 2], [-40, -2, 0], [8, -2, -5], [-16, -4, -6], [-16, 0, -2], [7, 0, 8], [22, -12, -6], [-7, 8, -3], [24, 0, -4], [3, -16, 5], [-6, -6, 12], [21, -6, -1], [18, -6, 4], [-16, -10, -10], [-1, -12, -7], [-11, -1, 2], [20, 8, 8], [-4, 0, -14], [22, -10, -2], [28, 8, 12], [8, 10, 1], [14, 6, -7], [25, 3, 8], [28, 4, 4], [-14, -10, -2], [13, 8, 18], [4, 2, 8], [7, 8, -1], [2, 10, 2], [8, -2, 5], [14, -4, 1], [2, -10, 5], [-24, 22, 8], [8, -6, 11], [2, 10, -8], [24, 0, -7], [13, 5, -4], [-32, 4, 2], [-14, 4, -7], [-7, -11, -17], [-13, -5, 2], [-12, 8, -5], [-16, -2, 7], [-10, 8, 8], [-36, 0, 2], [27, -6, -3], [-6, -8, -16]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_129_a_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_129_2_a_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_129_2_a_d(:prec:=3)
    chi := MakeCharacter_129_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(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_129_2_a_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_129_2_a_d( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_129_a();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<2,R![-8, -5, 2, 1]>],Snew);
    return Vf;
end function;