
// Make newform 363.3.b.c in Magma, downloaded from the LMFDB on 18 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_363_b();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_363_b_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_363_3_b_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_363_3_b_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, -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_363_b();"
function MakeCharacter_363_b()
    N := 363;
    order := 2;
    char_gens := [122, 244];
    v := [1, 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_363_b_Hecke();"
function MakeCharacter_363_b_Hecke(Kf)
    N := 363;
    order := 2;
    char_gens := [122, 244];
    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 := [[0, 0], [3, -1], [-3, 6], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0], [-9, 18], [0, 0], [37, 0], [25, 0], [0, 0], [0, 0], [24, -48], [24, -48], [-15, 30], [0, 0], [-35, 0], [15, -30], [0, 0], [0, 0], [0, 0], [45, -90], [95, 0], [0, 0], [-190, 0], [0, 0], [0, 0], [21, -42], [0, 0], [0, 0], [-21, 42], [0, 0], [0, 0], [0, 0], [-215, 0], [-70, 0], [0, 0], [0, 0], [-105, 210], [263, 0], [-105, 210], [0, 0], [0, 0], [-2, 0], [0, 0], [-445, 0], [0, 0], [433, 0], [0, 0], [0, 0], [0, 0], [135, -270], [-144, 288], [0, 0], [120, -240], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0], [-120, 240], [265, 0], [-189, 378], [563, 0], [0, 0], [0, 0], [0, 0], [99, -198], [0, 0], [635, 0], [0, 0], [-133, 0], [39, -78], [165, -330], [-790, 0], [-240, 480], [0, 0], [240, -480], [742, 0], [0, 0], [-25, 0], [0, 0], [-231, 462], [-195, 390], [0, 0], [0, 0], [35, 0], [-39, 78], [0, 0], [-875, 0], [0, 0], [-602, 0], [0, 0], [-45, 90], [-195, 390], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0], [-1055, 0], [96, -192], [0, 0], [-360, 720], [0, 0], [0, 0], [0, 0], [336, -672], [-1237, 0], [1213, 0], [-315, 630], [395, 0], [-351, 702], [51, -102], [0, 0], [1153, 0], [0, 0], [0, 0], [-336, 672], [-1093, 0], [0, 0], [1057, 0], [-255, 510], [-1355, 0], [0, 0], [0, 0], [0, 0], [973, 0], [70, 0], [0, 0], [0, 0], [216, -432], [0, 0], [51, -102], [0, 0], [0, 0], [0, 0], [755, 0], [0, 0], [-817, 0], [495, -990], [0, 0], [0, 0], [-757, 0], [504, -1008], [0, 0], [-285, 570], [-1370, 0], [0, 0], [-1750, 0], [120, -240], [0, 0], [480, -960], [0, 0], [0, 0], [399, -798], [0, 0], [0, 0], [-585, 1170], [459, -918], [-561, 1122], [1582, 0], [0, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_363_b_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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