
// Make newform 925.2.a.m in Magma, downloaded from the LMFDB on 03 January 2026.
// To make the character of type GrpDrchElt, type "MakeCharacter_925_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_925_2_a_m();".
// 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_925_2_a_m();".
// 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 := [-4, 4, 44, -22, -70, 15, 30, -6, -4, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0, 0, 0], [-3, -1, 1, 0, 0, 0, 0, 0, 0], [2, -3, -2, 1, 0, 0, 0, 0, 0], [-6, -4, 14, -1, -4, 1, 0, 0, 0], [-4, 14, 8, -7, -2, 1, 0, 0, 0], [6, 8, -34, -11, 25, 0, -5, 1, 0], [-2, 10, 14, -39, -13, 26, 0, -5, 1], [0, -22, -4, 52, 8, -29, 1, 5, -1]];
    Rf_basisdens := [1, 1, 1, 1, 2, 2, 2, 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_925_a();"
function MakeCharacter_925_a()
    N := 925;
    order := 1;
    char_gens := [852, 76];
    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_925_a_Hecke( : Kf := Kf)
    return MakeCharacter_925_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, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, -1, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 1, -1, 0, 1, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0, 0, 1], [1, 0, 1, 1, -1, 0, 1, 0, 1], [3, -1, 1, 0, -1, 0, 0, -1, 0], [0, -1, -1, 0, 0, 0, -1, -2, 0], [3, -1, 0, 0, 1, 1, 1, -1, -1], [-4, 3, -2, -1, 0, -2, -1, 1, 1], [1, -2, 1, 0, 0, -1, 0, 0, -2], [-1, 0, 0, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, -1, 1, 0, 2, -1], [1, 1, 1, 0, -4, 0, 1, 3, 1], [0, 4, 0, 0, 0, -3, 0, 2, 1], [0, 0, -2, 0, 2, 0, 1, -1, -3], [1, 1, 1, -1, 0, 1, 3, 1, -1], [0, 1, 0, -1, 4, 0, 1, -1, -1], [3, 0, 0, 0, 0, 0, 0, 1, -3], [0, 1, 1, -1, -1, 1, 0, 0, 2], [0, 0, 0, 0, 2, 0, 1, 1, 1], [-1, -2, 1, -1, 0, 1, 3, -1, -2], [7, 0, 0, -2, 2, 0, -1, -2, 0], [0, 3, 2, 2, -2, 0, 0, 0, -1], [-3, -1, -2, -2, -1, -1, -1, 1, 3], [-5, 5, -1, 0, 3, 0, 3, 2, -1], [-1, -1, -1, -2, 0, -2, -3, -1, -1], [4, 2, 0, 2, 0, -1, 1, 5, 0], [2, 1, 0, 2, -2, -2, 0, 2, 1], [3, 0, -2, 3, 0, -1, 1, -2, -1], [-5, 3, 3, 0, -3, -1, 1, 2, 3], [-6, 2, 1, -3, 0, -4, -2, 1, 1], [0, -3, 1, 0, -1, 1, -2, -4, 1], [8, -7, 3, 2, -1, 5, 2, -4, -3], [-3, 3, -3, -4, 3, -2, -5, -2, -1], [-2, 3, -1, 0, -3, 3, 0, 2, 1], [-6, 7, -3, -2, 5, 1, -1, -1, 0], [1, 0, 3, -3, -2, -2, 2, 2, 0], [7, -2, 1, -3, 0, 2, 2, 0, -2], [4, -1, 1, 0, -3, -1, 1, 3, 0], [0, -2, 1, 2, 6, 0, 5, -2, -3], [-3, 0, -2, -2, -4, -1, 1, 2, 2], [1, -5, 1, 5, 0, 1, 5, -3, 1], [-4, 4, 1, 0, 3, -1, 2, 2, 0], [-2, 2, -2, -2, 4, -2, -3, 1, -3], [-2, 3, -3, 1, 2, 0, 4, 3, 2], [-4, 1, -1, -1, -1, -3, 2, 4, -2], [-13, 3, -5, -2, -1, -3, -3, 0, 1], [7, 0, 0, -1, -3, 1, -2, 2, 2], [5, -1, 3, 6, 0, 4, 8, 2, -2], [0, 1, -5, 0, 5, -1, -6, -4, 3], [-4, 5, 3, -1, 0, 2, 2, 3, 2], [-2, -3, -2, 3, 0, 2, 3, 1, -3], [-8, 4, -3, -1, -2, -2, 4, 7, 1], [-1, -3, -4, -2, -2, 1, -2, 1, 2], [1, 4, 0, 2, -2, 2, 7, 6, 2], [7, -6, 2, 1, -4, 3, 3, 2, 1], [-12, 5, -7, 1, 5, -3, -4, 2, 2], [5, -7, 2, 2, 0, 7, 4, 1, -4], [16, -11, 4, 1, 0, 6, 1, -9, -5], [17, -8, 6, 3, 3, 3, -2, -8, -4], [10, -4, -4, -4, 6, 4, 2, -4, -8], [12, -6, -2, 2, -2, -1, -4, -2, -3], [3, -1, 3, 2, 2, 3, 8, -6, -3], [7, -1, 1, 2, 2, 4, -1, -9, -1], [0, 5, -3, -6, -1, -1, -6, -2, -1], [2, 4, -1, -2, 6, 0, -3, -4, 3], [-8, 1, 3, 0, -5, -1, 3, 3, -2], [3, 9, -2, 2, 3, -3, 1, -1, 1], [3, -8, 0, 1, 4, 1, -1, 0, -3], [8, 0, 3, 4, -1, 5, 4, 6, -4], [4, 4, -4, -1, -4, -4, -2, 2, -3], [-1, 0, 0, -6, 2, -4, -2, -1, 1], [0, -7, -3, -2, 1, -1, -9, -3, 2], [0, 4, -2, -1, -2, -2, 8, 0, 1], [3, -3, 2, 0, -7, -3, 7, 7, 1], [-2, 2, -4, -2, 8, 2, 0, -6, 0], [-4, 2, 4, 0, -4, -2, 3, 1, 3], [0, 2, 6, -3, -4, -4, -5, 3, 0], [0, -4, 8, 2, -2, 2, 2, 4, -2], [-4, -7, -3, -1, -1, -1, -8, 0, 0], [-2, 6, -4, -5, 0, -2, -3, 3, -2], [1, 0, -1, 1, 0, -3, -7, -9, 2], [-14, 12, -6, 2, 4, -4, -7, 3, 7], [-8, 1, 1, -5, 0, 2, -4, -3, 2], [6, 0, -8, 0, 2, -3, -2, 4, -1], [-12, -1, 0, 2, -6, -2, -6, -2, 5], [5, -9, 1, 6, -4, -2, 5, 5, -1], [6, -12, 0, 1, 2, 6, 1, -9, -4], [-11, 2, -4, 1, -3, 1, 8, 2, 4], [19, -6, -4, 3, -1, 3, 2, 0, 0], [12, -6, -5, 2, -4, 2, -1, -2, 1], [-7, 3, -1, -2, 4, 4, 1, -7, -5], [10, -4, 2, -4, 2, 8, 0, -2, 2], [-1, -4, 5, -6, -2, 1, -8, -2, 0], [7, 3, -3, 2, 4, -2, -9, -1, -1], [0, 6, 2, 1, 2, 0, 0, 2, 5], [-11, 4, -2, 2, -4, -9, -3, 6, 2], [9, -5, 5, 2, 2, 2, 1, 1, -3], [-20, 9, -2, -7, -2, -6, 1, 5, 3], [9, 2, -2, -1, 5, 5, 0, -8, -4], [5, -5, 0, 8, 2, -3, 8, 1, 0], [5, 12, -3, -1, -4, -2, -2, 2, 0], [20, -13, 0, -5, 8, 2, -3, -9, -11], [10, -3, 7, 5, -5, -1, -4, 4, 4], [11, -11, 11, 4, 3, 4, -4, 1, 0], [13, -4, -3, -1, 0, 2, -2, 2, 2], [-2, 6, -4, -8, 0, -2, -5, 1, 1], [4, -4, 2, 1, -4, 0, 4, 2, 5], [1, -2, -2, -7, -8, -5, -13, 0, 1], [9, 9, 3, 0, 0, 0, 5, 5, -3], [2, 3, 3, 2, 9, -1, -3, -11, -2], [16, -11, 1, 4, 1, 13, 5, -9, -2], [6, 6, 0, -1, -4, 0, 0, -2, 9], [10, -8, 3, -1, 0, 8, -4, -9, -3], [11, -11, -5, -4, 5, 4, -3, 2, -9], [9, -1, 2, 2, 7, 3, 9, 1, -7], [5, 0, 1, 7, 2, -6, 10, -4, 0], [-6, -7, 4, 1, -8, 0, -5, 1, 7], [-4, -5, -1, -1, -9, -3, -6, 4, 10], [-6, 3, 6, 4, -10, 0, 4, 12, 9], [-4, 4, 6, 0, -6, 2, 3, 7, -3], [2, -11, -5, 0, 7, 3, -9, -5, -4], [13, -10, 5, -5, -10, 2, -8, -6, -4], [0, -4, 2, 4, -6, -4, 0, -4, 4], [-6, -2, -2, 0, 2, -4, 0, -2, -4], [0, 4, 2, -3, 0, 2, 3, -1, -8], [-6, 3, 9, 5, -5, -1, 4, 10, 4], [-9, 0, 1, -9, -4, -6, -2, -4, 4], [-10, 8, -4, -4, 4, -4, 1, 5, -1], [2, 10, 0, 1, -4, -6, -2, 12, -1], [12, -4, -2, 4, -2, 7, 0, -6, 9], [-12, 10, -4, -1, 8, 2, -8, -8, -3], [-26, 9, -10, -5, -2, -6, -13, -3, 5], [-4, 12, 4, 3, 0, -2, 0, 2, 1], [18, 1, 2, 9, 0, 2, 7, -5, 1], [6, -11, 7, 2, 5, 11, 1, -9, -4], [8, -11, 11, -8, -5, 2, -10, -10, -2], [1, -4, 12, 3, -14, -3, 1, 4, 3], [6, -5, 4, 9, 6, 8, -1, -1, -1], [12, 1, 3, 5, 7, 7, 2, -8, -6], [2, -7, 3, -1, -7, -1, 4, -4, 8], [-20, 1, 5, 8, 3, 4, 7, 1, -7], [9, -3, 2, 10, -1, 1, 9, 5, 7], [-8, 4, -6, -8, 4, -2, 4, -2, -2], [-6, 8, 2, -4, -2, -8, -6, 8, 10], [-3, -3, -4, -6, 5, 5, 5, -5, -1], [5, 4, 1, -5, 16, 2, 4, -10, -6], [-27, 9, -11, -4, 10, -11, -10, 0, -1], [3, 1, 1, 6, 5, 3, 0, -7, -4], [4, -4, 8, 4, -4, 2, 4, 4, -6], [5, -7, -3, -7, -3, 2, -3, -2, 6], [3, 0, 6, 11, -5, -1, 6, 6, 10], [20, -13, 3, 4, -7, 2, -6, 2, 6], [13, -13, 6, 8, -5, 9, 9, -15, -5], [1, -3, 3, 2, -4, -5, 6, 10, 1], [-13, 4, -9, -3, 6, 1, -11, -9, -2], [17, -2, 2, -3, -11, 3, 6, 4, 2], [-20, 10, 2, 4, 0, -2, -1, 7, 5], [-13, 6, -4, -7, 4, -5, 3, -8, -3], [25, -9, 5, 6, 4, 2, -7, -9, -3], [-12, 6, 6, -2, -6, -6, -1, -5, 11], [9, 0, 2, 3, -5, 5, -6, -4, 6], [-16, 14, -2, -2, -4, -12, -2, 8, 2], [-17, 6, 2, -1, -3, 1, 2, -2, 6], [-17, 15, -7, -8, 5, 1, -5, 12, 1], [18, 7, -3, 4, 10, 2, -1, -6, -4], [2, 1, -6, 3, 12, 10, 7, -5, -5]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_925_a_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_925_2_a_m();".
// 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_925_2_a_m(:prec:=9)
    chi := MakeCharacter_925_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_925_2_a_m();".
// 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_925_2_a_m( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_925_a();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<2,R![12, -64, 44, 98, -91, -29, 40, -2, -5, 1]>,<3,R![162, -302, -78, 354, -64, -129, 48, 12, -8, 1]>],Snew);
    return Vf;
end function;