
// Make newform 35.3.d.b in Magma, downloaded from the LMFDB on 25 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_35_d();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_35_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_35_3_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_35_3_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 := [5, 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_35_d();"
function MakeCharacter_35_d()
    N := 35;
    order := 2;
    char_gens := [22, 31];
    v := [2, 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;

// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_35_d_Hecke();"
function MakeCharacter_35_d_Hecke(Kf)
    N := 35;
    order := 2;
    char_gens := [22, 31];
    char_values := [[1, 0], [-1, 0]];
    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 := 3;
    raw_aps := [[2, 0], [0, 1], [0, -1], [-2, -3], [-1, 0], [0, 9], [0, 3], [0, -6], [8, 0], [41, 0], [0, -18], [-28, 0], [0, -6], [-82, 0], [0, -9], [74, 0], [0, 42], [0, -36], [2, 0], [14, 0], [0, 30], [-19, 0], [0, -42], [0, -48], [0, 27], [0, 78], [0, -3], [-34, 0], [101, 0], [-112, 0], [62, 0], [0, 60], [-4, 0], [0, 36], [-94, 0], [-181, 0], [0, -78], [164, 0], [0, -69], [0, 33], [218, 0], [0, 66], [167, 0], [-172, 0], [302, 0], [0, 78], [107, 0], [0, -51], [0, 27], [0, -150], [-52, 0], [-307, 0], [0, -24], [0, -12], [0, -126], [98, 0], [0, -84], [0, 72], [176, 0], [-181, 0], [0, -63], [0, 165], [0, -189], [0, -114], [0, 21], [122, 0], [14, 0], [-64, 0], [-448, 0], [0, -66], [0, -111], [-334, 0], [0, 27], [-412, 0], [86, 0], [0, -210], [221, 0], [0, -105], [599, 0], [0, -6], [0, 270], [-61, 0], [227, 0], [0, 66], [0, 324], [-526, 0], [161, 0], [602, 0], [0, -24], [-316, 0], [0, 279], [0, 252], [332, 0], [-181, 0], [593, 0], [0, -195], [0, 84], [0, -234], [0, 378], [-1081, 0], [92, 0], [-928, 0], [0, 126], [-574, 0], [-226, 0], [0, 279], [0, 90], [0, -87], [581, 0], [0, -486], [0, -153], [-922, 0], [332, 0], [0, 48], [839, 0], [614, 0], [0, 213], [0, 414], [314, 0], [-787, 0], [0, 252], [-76, 0], [0, -537], [248, 0], [0, 360], [47, 0], [-247, 0], [0, 0], [0, -222], [0, -279], [581, 0], [494, 0], [-1153, 0], [-88, 0], [0, -204], [0, 402], [0, -363], [0, 123], [0, -117], [941, 0], [0, 456], [-1273, 0], [818, 0], [-148, 0], [0, -294], [0, 144], [0, -690], [0, -390], [0, -564], [338, 0], [-514, 0], [0, 144], [-1252, 0], [0, -414], [-1084, 0], [-1066, 0], [521, 0], [0, 174], [0, -57], [0, 816], [626, 0], [218, 0], [-514, 0], [0, -102], [602, 0], [0, 597], [-766, 0], [0, 207]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_35_d_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_35_3_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_35_3_d_b(:prec:=2)
    chi := MakeCharacter_35_d();
    f_vec := qexpCoeffs();
    Kf := Universe(f_vec);
    // SetVerbose("ModularForms", true);
    // SetVerbose("ModularSymbols", true);
    S := CuspidalSubspace(ModularForms(chi, 3));
    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_35_3_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_35_3_d_b( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_35_d();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,3,sign)));
    Vf := Kernel([<2,R![-2, 1]>],Snew);
    return Vf;
end function;