
// Make newform 65.2.a.c in Magma, downloaded from the LMFDB on 24 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_65_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_65_2_a_c();".
// 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_65_2_a_c();".
// 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 := [-3, 0, 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_65_a();"
function MakeCharacter_65_a()
    N := 65;
    order := 1;
    char_gens := [27, 41];
    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_65_a_Hecke(Kf)
    return MakeCharacter_65_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+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 := [[0, 1], [1, -1], [-1, 0], [2, 0], [-3, 1], [1, 0], [0, 2], [-1, 3], [3, 1], [-6, -2], [5, -3], [-4, 0], [0, -2], [5, 3], [6, 0], [0, -6], [-3, -7], [2, 6], [-4, -6], [3, -1], [-4, 0], [2, 6], [-6, 0], [-6, 4], [2, 0], [6, 4], [5, 3], [9, -5], [2, 0], [12, 2], [11, -3], [0, 0], [-6, -4], [2, -6], [6, 8], [-7, -3], [-10, 0], [-4, 6], [6, 4], [12, 2], [-12, 4], [-10, -6], [-12, -4], [-10, 0], [-6, 4], [20, 0], [8, 0], [2, 0], [0, 2], [-4, -6], [-6, 0], [-9, 3], [8, 6], [-18, 2], [6, -8], [3, 1], [-6, 8], [5, -15], [-16, 6], [12, -6], [17, -9], [-12, -4], [2, 12], [-6, 6], [-4, 6], [24, 0], [-13, -9], [-16, 6], [3, 5], [-4, 6], [0, 16], [3, 3], [17, 3], [-10, 0], [-7, -15], [6, -4], [6, 0], [8, -12], [-30, 4], [-28, -6], [-6, -2], [-10, 12], [-3, 13], [14, -12], [32, 0], [9, 15], [24, 2], [-10, -12], [0, 2], [8, 6], [33, 3], [27, -5], [-16, 6], [-6, -2], [-13, 15], [-3, -13], [36, -2], [-18, 6], [-19, 3], [-16, 6], [-7, 3], [-12, -8], [-3, 11], [-6, -2], [26, -6], [-4, 0], [-12, -2], [6, -12], [-18, -6], [2, -24], [-1, -15], [26, 0], [6, -16], [-19, -15], [11, 3], [6, -4], [14, 12], [3, -11], [-6, -8], [-18, 2], [-10, -12], [-4, 6], [0, -6], [36, 2], [-1, 27], [42, 0], [20, -6], [-12, 8], [29, -9], [38, 0], [-13, 3], [-30, -8], [26, -6], [8, 6], [-6, 8], [14, -12], [0, -4], [-10, -24], [-6, 20], [-6, -2], [23, 3], [-6, -20], [-31, -9], [18, 0], [-10, -6], [9, 5], [8, 0], [6, 24], [14, 18], [-18, 12], [2, 0], [-30, 10], [29, 3], [-15, 19], [-7, 27], [-36, 0], [-22, -18], [48, 2], [14, -12], [0, -18], [6, -20], [-6, -4], [-40, 6], [12, -4], [12, 16], [-24, 6], [8, 0], [44, 6]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_65_a_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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