
// Make newform 384.6.f.b in Magma, downloaded from the LMFDB on 23 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_384_f();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_384_f_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_384_6_f_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_384_6_f_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, 0, 0, 0, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0], [0, 1, -1, -1], [0, 2, 0, 2], [0, 2, 4, -2]];
    Rf_basisdens := [1, 1, 1, 1];
    Rf_basisnums := ChangeUniverse([[z : z in elt] : elt in Rf_num], Kf);
    Rfbasis := [Rf_basisnums[i]/Rf_basisdens[i] : i in [1..Degree(Kf)]];
    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_384_f();"
function MakeCharacter_384_f()
    N := 384;
    order := 2;
    char_gens := [127, 133, 257];
    v := [1, 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;

// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_384_f_Hecke();"
function MakeCharacter_384_f_Hecke(Kf)
    N := 384;
    order := 2;
    char_gens := [127, 133, 257];
    char_values := [[-1, 0, 0, 0], [-1, 0, 0, 0], [-1, 0, 0, 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 := 6;
    raw_aps := [[0, 0, 0, 0], [0, -7, 0, -2], [0, 0, 0, 0], [0, 0, 0, 0], [0, -158, 0, 79], [0, 0, 0, 0], [0, 0, -502, 0], [0, 596, 0, 149], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, -5804, 0], [0, 4204, 0, 1051], [0, 0, 0, 0], [0, 0, 0, 0], [0, -16162, 0, 8081], [0, 0, 0, 0], [0, -14036, 0, -3509], [0, 0, 0, 0], [-50402, 0, 0, 0], [0, 0, 0, 0], [0, -29766, 0, 14883], [0, 0, 52778, 0], [85450, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, -78562, 0, 39281], [0, 0, 0, 0], [0, 0, 31636, 0], [0, 0, 0, 0], [0, -128634, 0, 64317], [0, 0, -42152, 0], [0, 206996, 0, 51749], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, -295548, 0, -73887], [0, 0, 0, 0], [0, 0, 0, 0], [0, -148794, 0, 74397], [0, 0, 0, 0], [0, 0, 0, 0], [-1024298, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, -493572, 0, -123393], [0, 0, 0, 0], [0, 461450, 0, -230725], [0, 0, 0, 0], [0, 0, 470378, 0], [0, 0, 0, 0], [1747174, 0, 0, 0], [0, 542242, 0, -271121], [0, 0, 728596, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 891950, 0], [0, 1158852, 0, 289713], [0, 0, 0, 0], [0, -1463636, 0, -365909], [0, 0, 0, 0], [-3433450, 0, 0, 0], [0, 0, 0, 0], [0, 1256772, 0, 314193], [3864014, 0, 0, 0], [0, 1081762, 0, -540881], [0, 0, 0, 0], [0, 0, 147928, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, -2347796, 0, -586949], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 1663046, 0], [-1779382, 0, 0, 0], [0, -1824006, 0, 912003], [0, 0, 0, 0], [0, 0, 0, 0], [3939802, 0, 0, 0], [0, 0, 0, 0], [0, -2599534, 0, 1299767], [0, 0, 1874378, 0], [-1129414, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, -2010550, 0, 1005275], [0, 0, 0, 0], [0, 0, 0, 0], [0, -189266, 0, 94633], [0, 119900, 0, 29975], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 3463504, 0], [0, 1116348, 0, 279087], [0, 0, 0, 0], [0, 5217236, 0, 1304309], [0, 0, 0, 0], [0, -1386550, 0, 693275], [0, 0, -3394472, 0], [0, -5375900, 0, -1343975], [11358686, 0, 0, 0], [0, -3236962, 0, 1618481], [0, 0, -1916336, 0], [0, 0, 0, 0], [-3455474, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, -6652954, 0], [0, -8303900, 0, -2075975], [0, 0, 0, 0], [0, 0, -1304050, 0], [0, 7363796, 0, 1840949], [0, 0, 0, 0], [0, 0, 0, 0], [0, 7252806, 0, -3626403], [0, 0, 0, 0], [19381450, 0, 0, 0], [0, 0, 0, 0], [0, 8118866, 0, -4059433], [0, -6821628, 0, -1705407], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 13607900, 0, 3401975], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 9699796, 0], [29261782, 0, 0, 0], [0, 0, 0, 0], [0, -11602428, 0, -2900607], [0, 0, 0, 0], [0, 0, -11368100, 0], [0, 15407900, 0, 3851975], [0, 0, 0, 0], [0, 0, 0, 0], [0, 2429262, 0, -1214631], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, -13923752, 0], [0, -13541396, 0, -3385349], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, -496100, 0], [0, -21535052, 0, -5383763], [0, 0, 0, 0], [0, 15695372, 0, 3923843], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, -12392050, 0], [10550914, 0, 0, 0], [0, 0, 0, 0], [0, -10325450, 0, 5162725], [0, 0, -16373936, 0], [0, 0, 0, 0], [0, -16918542, 0, 8459271], [0, 0, -18706798, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_384_f_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_384_6_f_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_384_6_f_b(:prec:=4)
    chi := MakeCharacter_384_f();
    f_vec := qexpCoeffs();
    Kf := Universe(f_vec);
    // SetVerbose("ModularForms", true);
    // SetVerbose("ModularSymbols", true);
    S := CuspidalSubspace(ModularForms(chi, 6));
    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_384_6_f_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_384_6_f_b( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_384_f();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,6,sign)));
    Vf := Kernel([<5,R![0, 1]>,<23,R![0, 1]>],Snew);
    return Vf;
end function;