
// Make newform 385.2.n.b in Magma, downloaded from the LMFDB on 24 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_385_n();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_385_n_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_385_2_n_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_385_2_n_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_385_n();"
function MakeCharacter_385_n()
    N := 385;
    order := 5;
    char_gens := [232, 276, 211];
    v := [5, 5, 4];
    // 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_385_n_Hecke();"
function MakeCharacter_385_n_Hecke(Kf)
    N := 385;
    order := 5;
    char_gens := [232, 276, 211];
    char_values := [[1, 0, 0, 0], [1, 0, 0, 0], [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, 1, -1, -1], [0, 1, -1, 1], [0, 1, 0, 0], [0, 0, 0, 1], [1, 1, 1, -3], [-4, 3, -3, 4], [-1, -4, -1, 0], [0, -2, 0, -2], [-2, 0, -4, 4], [3, -3, 0, 1], [-2, 0, 0, 2], [-2, 2, 0, 6], [0, 4, -4, 4], [-4, 0, -2, 2], [0, 3, -6, 3], [4, -8, 8, -4], [-2, 2, 0, 8], [-2, 8, -2, 0], [2, 0, 10, -10], [-7, -5, -7, 0], [-1, 1, 0, -7], [-4, -7, 7, 4], [-9, 5, -9, 0], [14, 0, -2, 2], [11, -4, 4, -11], [10, -4, 4, -10], [-7, 7, 0, 13], [0, -2, -4, -2], [-14, 0, 4, -4], [0, 4, 4, 4], [-2, -6, -2, 0], [8, 0, 0, 0], [12, -8, 12, 0], [-4, 4, 0, -8], [3, 13, 3, 0], [0, 1, -2, 1], [0, -5, -8, -5], [16, -6, 6, -16], [12, -12, 12, -12], [0, -9, 13, -9], [0, 1, 18, 1], [4, -12, 4, 0], [5, -5, 0, -20], [0, -4, 0, 0], [-12, 0, 0, 0], [-18, 0, 0, 0], [-12, 19, -19, 12], [0, -4, 8, -4], [-11, 11, 0, 4], [26, -28, 28, -26], [2, -16, 16, -2], [0, 21, -9, 21], [-6, 0, -18, 18], [4, 2, -2, -4], [1, -1, 0, 3], [8, 0, 10, -10], [14, -4, 14, 0], [2, -2, 0, -22], [2, 10, -10, -2], [4, 2, 4, 0], [0, 9, -22, 9], [-12, 12, 0, 2], [-15, 0, -9, 9], [0, 18, -16, 18], [0, 18, 0, 0], [24, -28, 28, -24], [-8, 0, -17, 17], [-12, 12, 0, 24], [-4, 8, -4, 0], [0, 16, -22, 16], [-8, 0, -9, 9], [-21, 21, 0, 0], [-25, 25, 0, 16], [0, 0, 18, -18], [-19, 6, -19, 0], [-20, 9, -9, 20], [-9, 9, 0, 28], [16, 0, 31, -31], [-17, 12, -17, 0], [2, 0, 0, -2], [-18, 0, -28, 28], [0, -17, -7, -17], [1, 6, -6, -1], [13, -13, 0, -4], [8, 0, -6, 6], [0, 14, -26, 14], [0, 15, -15, 0], [32, -14, 32, 0], [20, 0, -6, 6], [-6, 0, -18, 18], [7, 21, 7, 0], [-14, 0, -14, 0], [0, 10, -18, 10], [-16, 16, 0, -12], [-13, 13, 0, 15], [0, 5, -5, 5], [0, 20, -6, 20], [-10, 10, 0, 8], [3, -6, 3, 0], [-8, 11, -11, 8], [0, -26, 24, -26], [-6, 6, 0, 14], [23, -22, 22, -23], [0, -11, -20, -11], [-23, 0, -21, 21], [-23, 4, -23, 0], [-15, 15, 0, -16], [3, 0, 11, -11], [-15, -2, -15, 0], [-12, 12, 0, 8], [5, -10, 10, -5], [0, -24, -2, -24], [-4, 0, 2, -2], [0, -4, -16, -4], [-17, 17, 0, -1], [0, 21, -13, 21], [-11, 7, -11, 0], [45, -42, 42, -45], [-10, 10, 0, 32], [4, 0, -13, 13], [-14, 0, 12, -12], [-12, -4, 4, 12], [-3, -44, -3, 0], [36, 0, -2, 2], [12, 12, -12, -12], [0, -28, -6, -28], [19, -31, 19, 0], [16, -16, 0, -12], [-36, 0, -9, 9], [37, -37, 0, -12], [-12, 12, -12, 12], [14, -28, 14, 0], [0, 7, 26, 7], [2, -12, 12, -2], [-34, 10, -10, 34], [8, 0, 6, -6], [0, 1, -29, 1], [-13, -19, -13, 0], [-39, 19, -39, 0], [5, -5, 5, 0], [0, 12, 12, 12], [-7, 7, 0, -17], [20, -20, 20, -20], [28, -12, 12, -28], [16, -16, 0, -24], [0, -20, 40, -20], [9, -33, 9, 0], [-30, 0, -44, 44], [-16, 0, 8, -8], [8, -16, 8, 0], [0, 34, 0, 34], [-4, 0, -2, 2], [0, -10, 6, -10], [3, -3, 0, 23], [-16, -2, -16, 0], [-9, 26, -26, 9], [-15, 22, -15, 0], [16, -8, 16, 0], [-16, 41, -41, 16], [30, -18, 30, 0], [18, 0, 26, -26], [8, -8, 0, -38], [-18, 0, 2, -2], [0, 12, -22, 12], [-40, 38, -38, 40], [-21, 21, 0, 15], [12, 0, 3, -3], [-23, 23, 0, 11]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_385_n_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_385_2_n_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_385_2_n_b(:prec:=4)
    chi := MakeCharacter_385_n();
    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_385_2_n_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_385_2_n_b( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_385_n();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<2,R![25, -25, 15, -5, 1]>],Snew);
    return Vf;
end function;