
// Make newform 110.2.a.d in Magma, downloaded from the LMFDB on 17 December 2025.
// To make the character of type GrpDrchElt, type "MakeCharacter_110_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_110_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_110_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 := [-8, -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_110_a();"
function MakeCharacter_110_a()
    N := 110;
    order := 1;
    char_gens := [67, 101];
    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_110_a_Hecke( : Kf := Kf)
    return MakeCharacter_110_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, 0], [0, -1], [1, 0], [0, 1], [-1, 0], [2, 0], [-2, 1], [4, -1], [-4, 2], [-2, 1], [0, 1], [6, 1], [2, -4], [-4, 0], [-4, 2], [6, -3], [4, -2], [-2, -1], [8, 0], [0, 3], [-2, -4], [-8, 2], [4, -2], [2, -1], [-6, -2], [6, 0], [4, -4], [-12, 0], [-2, -4], [10, -2], [8, 0], [12, 3], [2, 2], [-4, 0], [-2, 7], [8, -6], [6, 1], [-16, 3], [-8, 1], [-6, 0], [-12, 0], [-10, 0], [8, -4], [-2, 5], [-14, -2], [8, 3], [-4, 3], [-12, -2], [4, -2], [-10, 0], [-2, 1], [-8, -2], [-22, 0], [-4, 2], [18, 0], [-8, -5], [-2, -2], [-16, 0], [-6, -2], [18, 0], [12, -2], [10, 4], [12, -2], [16, 1], [-22, 0], [6, -9], [4, 8], [14, 3], [-12, -6], [6, 4], [-14, 4], [0, 0], [-4, 0], [18, 4], [20, -6], [12, 6], [6, 0], [-2, 8], [10, 1], [-22, 6], [-12, 0], [-10, 6], [-8, -8], [-6, 10], [-8, 8], [16, 4], [2, 8], [14, -9], [6, 3], [20, -6], [-16, -1], [-8, 4], [20, 0], [-4, -1], [-20, -4], [-8, -8], [30, -6], [26, -4], [4, 8], [-10, -3], [20, 0], [-22, 8], [12, -6], [-22, 2], [12, 1], [10, 8], [8, 5], [-26, 4], [-16, -7], [-30, 4], [-16, 3], [34, -4], [18, -6], [-4, -12], [32, 3], [10, -11], [-16, 3], [-4, -10], [14, -1], [-4, 5], [22, -4], [-2, 5], [10, -2], [-32, 1], [20, 6], [-34, -1], [-10, 0], [24, -3], [-4, -6], [26, 6], [20, -12], [-8, 1], [-8, 5], [6, -8], [-22, 8], [-22, 0], [-10, -7], [-4, -12], [-2, 4], [18, 0], [28, 5], [-2, 4], [-28, 0], [20, 8], [-18, -2], [16, -8], [2, -12], [6, 9], [-36, -2], [28, -2], [10, 8], [18, 0], [0, 1], [16, -8], [-24, 7], [-32, 7], [-8, 8], [-6, 9], [-42, 4], [22, -11], [32, 5], [30, 3], [24, 7], [-28, 8], [-6, 6], [20, -10], [8, 0], [2, 6]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_110_a_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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