
// Make newform 49.4.a.d in Magma, downloaded from the LMFDB on 01 May 2026.
// To make the character of type GrpDrchElt, type "MakeCharacter_49_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_49_4_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_49_4_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
        Kf := Rationals();
    end if;
    return [Kf!elt[1] : elt in input];
end function;


// To make the character of type GrpDrchElt, type "MakeCharacter_49_a();"
function MakeCharacter_49_a()
    N := 49;
    order := 1;
    char_gens := [3];
    v := [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_49_a_Hecke( : Kf := Kf)
    return MakeCharacter_49_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 := 4;
    raw_aps := [[2], [7], [7], [0], [-5], [-14], [-21], [49], [-159], [58], [147], [219], [350], [-124], [525], [303], [-105], [-413], [415], [-432], [-1113], [-103], [1092], [-329], [-882], [1379], [-679], [457], [-1125], [-1538], [72], [2149], [-1125], [252], [-201], [1619], [679], [-467], [1204], [-2821], [-3253], [1582], [2557], [-397], [2914], [3339], [1780], [-1400], [-2205], [287], [4587], [1668], [-3409], [-4760], [-805], [-257], [3591], [1393], [415], [-4954], [-4277], [7742], [-7364], [9975], [-4753], [-3477], [3341], [7366], [7415], [-3878], [1267], [4685], [-4641], [-8797], [13680], [9765], [1731], [10983], [6603], [10955], [6636], [-16630], [4923], [8974], [-4179], [-12927], [-2826], [8479], [9338], [-4016], [-5859], [6503], [-16049], [8864], [-10211], [-1680], [-9457], [-18081], [20377], [-6193], [-18464], [-9413], [3199], [21583], [20267], [13951], [-20972], [-189], [-10281], [-6090], [4949], [-15797], [-9378], [-24353], [-12640], [-1041], [9548], [-3241], [-8853], [7044], [-12089], [982], [-30513], [11475], [-28315], [10614], [10299], [32529], [29456], [27867], [19539], [1248], [28093], [35954], [-861], [24710], [16499], [16471], [-36470], [35751], [-16492], [-41473], [-25065], [9732], [27755], [21112], [-21238], [-35609], [2177], [-32247], [27631], [24402], [-19612], [2261], [-23833], [31824], [-16819], [1799], [14154], [12047], [-24379], [-52330], [-12416], [36813], [34995], [-14301], [-2665], [24871]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_49_a_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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