
// Make newform 625.2.d.b in Magma, downloaded from the LMFDB on 25 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_625_d();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_625_d_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_625_2_d_b();".
// 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_625_2_d_b();".
// 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, 1, -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_625_d();"
function MakeCharacter_625_d()
    N := 625;
    order := 5;
    char_gens := [2];
    v := [2];
    // 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_625_d_Hecke();"
function MakeCharacter_625_d_Hecke(Kf)
    N := 625;
    order := 5;
    char_gens := [2];
    char_values := [[0, 0, 0, -1]];
    assert UnitGenerators(DirichletGroup(N)) eq char_gens;
    values := ConvertToHeckeField(char_values : pass_field := true, 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+1)]];
    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], [0, 0, 0, 1], [0, 0, 0, 0], [0, 0, -1, 1], [4, -2, 2, -4], [3, -3, 3, 0], [0, 2, 2, 2], [0, 3, -4, 3], [5, -7, 7, -5], [-1, 1, 0, 3], [0, 0, -3, 0], [-2, 3, -2, 0], [-2, 4, -2, 0], [3, 0, 3, -3], [-1, 1, 0, 0], [4, -4, 0, -1], [3, 6, 3, 0], [-5, -1, 1, 5], [0, 2, -8, 2], [-1, 1, 0, 6], [-9, 9, -9, 9], [-5, 5, 0, 5], [0, 2, 3, 2], [4, 4, -4, -4], [3, -3, 0, -2], [-1, 0, 4, -4], [-9, 9, 0, 3], [9, 0, 12, -12], [0, -10, 0, 0], [3, 12, 3, 0], [10, 6, -6, -10], [0, 11, -11, 11], [-8, 1, -8, 0], [-5, 5, -5, 5], [1, 0, -8, 8], [9, 0, 9, -9], [-7, 0, -10, 10], [0, 11, 0, 0], [0, -9, 0, -9], [9, 7, -7, -9], [4, -4, 0, 3], [0, -6, 10, -6], [-10, 18, -10, 0], [-4, 0, -6, 6], [-6, 6, 0, 0], [-12, 0, -9, 9], [3, 7, -7, -3], [6, -16, 16, -6], [16, -18, 18, -16], [6, -6, 0, -18], [0, 8, -10, 8], [23, -27, 27, -23], [4, -9, 4, 0], [-23, 0, -10, 10], [-21, 0, -3, 3], [5, -19, 5, 0], [0, 2, -16, 2], [0, 0, 0, 8], [-21, 15, -15, 21], [0, 5, 2, 5], [0, 3, 25, 3], [22, 0, -4, 4], [-8, 0, -2, 2], [2, -19, 19, -2], [2, -20, 2, 0], [0, -14, 15, -14], [0, -18, 6, -18], [3, 3, 3, 0], [-5, 5, 0, -23], [18, 0, 6, -6], [5, -5, 0, 16], [-19, 17, -19, 0], [0, 9, 11, 9], [-19, 4, -4, 19], [22, -22, 0, -1], [0, -20, -1, -20], [-15, 15, -15, 15], [-13, 13, 0, 21], [13, 0, 22, -22], [12, -21, 12, 0], [0, -4, -3, -4], [0, 0, 0, -32], [0, -24, 9, -24], [0, -3, -22, -3], [28, -7, 7, -28], [-25, 0, -8, 8], [9, 0, -7, 7], [14, 0, 12, -12], [-7, 17, -17, 7], [-18, 5, -18, 0], [0, -25, 13, -25], [-3, 3, 0, 9], [-12, -17, -12, 0], [36, -15, 36, 0], [2, 0, 9, -9], [12, -12, 0, -30], [7, 9, 7, 0], [20, -20, 0, -17], [-15, 18, -18, 15], [-18, 2, -18, 0], [-6, 6, 0, -25], [-6, 0, 2, -2], [-1, 9, -1, 0], [0, -4, 27, -4], [-18, 18, 0, -3], [-14, -18, 18, 14], [-6, 15, -6, 0], [14, 0, -5, 5], [-7, 0, -4, 4], [12, 0, -15, 15], [30, 0, 9, -9], [-21, 19, -21, 0], [0, -2, -11, -2], [0, -4, 37, -4], [0, -2, -7, -2], [5, -7, 5, 0], [16, 0, 24, -24], [30, -30, 0, -18], [-5, 5, 0, 16], [4, -22, 4, 0], [-3, -24, 24, 3], [6, 4, -4, -6], [10, -9, 9, -10], [0, 4, 7, 4], [-15, -12, -15, 0], [-20, 0, -34, 34], [30, -15, 30, 0], [0, 6, -33, 6], [19, -10, 10, -19], [0, 21, -14, 21], [-3, -18, 18, 3], [-16, 0, -20, 20], [-15, 0, 16, -16], [-23, 0, -12, 12], [3, 22, -22, -3], [0, 12, -6, 12], [-17, -14, 14, 17], [10, -28, 10, 0], [2, -2, 0, 11], [-21, 3, -21, 0], [11, -5, 5, -11], [-27, 27, 0, 24], [44, -38, 38, -44], [-9, 22, -22, 9], [-3, 3, 0, 34], [-9, 6, -6, 9], [28, -28, 0, 2], [-3, 0, -27, 27], [-12, 21, -12, 0], [9, -36, 9, 0], [-18, -12, 12, 18], [0, -20, -8, -20], [0, -12, 40, -12], [16, 4, 16, 0], [11, 0, 36, -36], [39, -37, 37, -39], [0, -23, -16, -23], [35, -35, 0, -20], [-15, 42, -15, 0], [12, 27, 12, 0], [-14, 14, 0, -6], [19, -19, 0, 4], [0, 16, -30, 16], [1, -1, 0, -5], [-11, 25, -25, 11], [0, -1, -8, -1], [20, -17, 20, 0], [-16, 16, 0, 15]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_625_d_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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