
// Make newform 363.3.b.e in Magma, downloaded from the LMFDB on 24 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_e();".
// 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_e();".
// 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_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, 0], [0, 0], [0, -5], [0, 0], [0, 8], [0, 0], [0, 21], [0, 0], [0, 0], [-59, 0], [-47, 0], [0, 0], [0, -48], [0, 0], [0, 0], [0, 0], [0, -9], [13, 0], [0, 0], [0, 17], [0, -91], [0, 0], [0, 0], [-169, 0], [0, 0], [-157, 0], [0, 0], [0, 95], [0, 0], [0, 13], [0, 0], [0, 0], [0, 160], [0, 0], [0, -56], [193, 0], [-37, 0], [0, 0], [0, 0], [0, 0], [-1, 0], [0, 0], [0, -207], [0, 0], [277, 0], [0, 195], [83, 0], [0, 0], [-26, 0], [0, 0], [0, 0], [0, -224], [0, 0], [0, 0], [0, 0], [0, 0], [0, -280], [0, 217], [0, 0], [0, -133], [0, 0], [0, -323], [0, 0], [142, 0], [0, 0], [299, 0], [0, 105], [0, 0], [0, -111], [0, 0], [0, 0], [-718, 0], [0, 425], [-694, 0], [0, 0], [0, 0], [431, 0], [0, 0], [0, -465], [0, 0], [358, 0], [0, 0], [503, 0], [0, 205], [0, 0], [0, 0], [0, -240], [0, 0], [-526, 0], [0, 0], [0, 0], [-962, 0], [0, 0], [877, 0], [0, 0], [0, 0], [0, 0], [0, 387], [0, 184], [0, 560], [0, 0], [0, 0], [0, 0], [0, -235], [1033, 0], [0, 0], [0, 0], [0, 0], [0, -49], [0, -520], [0, 703], [0, 0], [-214, 0], [-674, 0], [0, 0], [923, 0], [0, 0], [0, 0], [0, 0], [1201, 0], [0, -377], [0, 0], [0, 0], [1019, 0], [0, 0], [934, 0], [0, 0], [-482, 0], [0, 600], [0, 371], [0, 0], [1381, 0], [-1511, 0], [0, 0], [0, 799], [0, 0], [0, 112], [0, 0], [0, 0], [0, -925], [0, 0], [-1621, 0], [0, 0], [-1609, 0], [0, 0], [0, -713], [0, 0], [-1549, 0], [0, 0], [0, -177], [0, 0], [-1259, 0], [0, 0], [-1453, 0], [0, 0], [0, 35], [0, 0], [0, -1015], [0, 0], [0, 0], [0, 0], [0, 1107], [0, 0], [0, 0], [0, 0], [46, 0], [0, -1127]];
    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_e();".
// 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_e(: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_e();".
// 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_e( : 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![0, 1]>,<7,R![-75, 0, 1]>],Snew);
    return Vf;
end function;