
// Make newform 663.2.bp.a in Magma, downloaded from the LMFDB on 03 May 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_663_bp();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_663_bp_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_663_2_bp_a();".
// 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_663_2_bp_a();".
// 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 := [256, 0, -144, 0, 65, 0, -9, 0, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0, 0], [-1296, 0, 585, 0, -65, 0, 9, 0], [0, -181, 0, 0, 0, 0, 0, -1], [116, 0, 0, 0, 0, 0, 1, 0], [4176, 0, -1885, 0, 325, 0, -29, 0], [0, -256, 0, 585, 0, -65, 0, 9], [0, -256, 0, 377, 0, -65, 0, 9]];
    Rf_basisdens := [1, 1, 1040, 260, 65, 1040, 1040, 832];
    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_663_bp();"
function MakeCharacter_663_bp()
    N := 663;
    order := 12;
    char_gens := [443, 613, 547];
    v := [6, 7, 6];
    // 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_663_bp_Hecke();"
function MakeCharacter_663_bp_Hecke(Kf)
    N := 663;
    order := 12;
    char_gens := [443, 613, 547];
    char_values := [[-1, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0, 0], [-1, 0, 0, 0, 0, 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 := 2;
    raw_aps := [[0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, -1, 0, 0, 0, 1], [-1, -1, 1, 0, -1, 1, 0, -1], [0, 0, 0, 0, 0, 0, 0, 0], [3, 0, 1, -3, 0, -1, -1, -2], [1, 0, -1, 0, 1, -2, 0, 0], [0, 2, 0, -1, 0, 0, 0, 0], [-1, -1, 3, 3, -2, 1, 2, 1], [-2, 0, 3, 0, 1, 1, 0, 0], [5, 0, 7, 0, -2, 2, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [4, -1, -4, 4, 1, -1, 1, -3], [0, 3, 0, -7, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [2, -4, 3, 2, 4, -2, 2, 5], [2, -4, -1, 1, 0, -4, 0, -2], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [-9, 0, -20, 0, 1, -2, 0, 0], [0, 5, 0, -3, 0, 0, 5, 3], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 2, 0, 0, -5, 0, 0], [0, -9, 0, 8, 0, 0, 9, 8], [-1, 0, 0, 0, -2, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [-11, -2, -11, -9, -2, -2, 4, 2], [0, 12, 0, -6, 0, 0, -6, -3], [0, 0, 0, 0, 0, 0, 0, 0], [2, -5, -2, -2, -5, 5, 5, 7], [0, 1, 0, 22, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [-3, -5, -11, -3, 5, 0, 0, -11], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [14, 1, 1, 14, -1, 2, -2, -1], [6, 0, -6, -5, 7, -7, -7, -6], [4, -4, 3, 7, 8, -4, -4, 3], [0, 0, 0, 0, 0, 0, -10, -5], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, -7, 0, -1, 0, 0, 14, -2], [14, 3, -3, -14, 3, -6, -6, -3], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [15, -2, 15, 17, -2, -2, 4, 2], [0, 0, 0, 0, 0, 0, 4, 29], [0, 0, 0, 0, 0, 0, 0, 0], [20, 2, 9, -11, 0, -2, -2, 9], [1, 5, 5, -6, -5, 10, 5, -1], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, -11, 0, 0, 8, 0, 0], [5, 10, 3, -5, 10, -5, -5, -8], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 8, 0, -4, 0, 0, -16, -8], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [-23, 0, -12, 23, 0, -1, -1, 11], [-12, 5, 5, 7, -5, 10, 5, 12], [0, -8, 0, -3, 0, 0, -8, 3], [3, 3, 16, -19, 6, -3, 3, -16], [22, 0, 13, 22, 0, 4, -4, 9], [0, 3, 0, 19, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [13, 0, -13, 24, 2, -2, 2, 13], [20, -3, 20, 20, 3, 3, -3, 17], [0, 0, 0, 0, 0, 0, 0, 0], [1, -12, -6, 6, 6, -12, 6, 5], [0, 0, 0, 0, 0, 0, 0, 0], [-6, 7, -19, 6, 7, 0, 0, 19], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, -37, 0, 0, -5, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 22, 0, -8, 0, 0, -11, -4], [0, 6, 0, -11, 0, 0, 6, 11], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [3, 3, -23, 20, 6, -3, 3, 23], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [-25, 1, 1, -25, -1, 2, -2, -1], [-13, -10, -16, -3, -10, 0, 10, 13], [0, 0, 0, 0, 0, 0, 0, 0], [1, 7, -7, -6, 7, -14, 7, 1], [0, -22, 0, 11, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 5, 0, -16, 0, 0, 5, 16], [0, 0, 0, 0, 0, 0, 0, 0], [5, 10, 16, -5, 10, -5, -5, -21], [0, 0, 0, 0, 0, 0, 0, 0], [-41, 0, 0, 0, -7, 0, 0, 0], [-13, 0, 13, -15, -11, 11, -11, -13], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [-2, 0, -1, 0, 0, 0, 0, 0], [2, 0, -4, 0, 4, -8, 0, 0], [-25, -8, 4, 4, -4, 8, 4, -21], [5, 10, -23, -5, 10, -5, -5, 18], [-30, 0, -13, -30, 0, 4, -4, -17], [0, 0, 0, 0, 0, 0, 0, 0], [0, -7, 0, 15, 0, 0, -7, -15], [0, 0, 0, 0, 0, 0, 0, 0], [27, 1, 1, 27, -1, 2, -2, -1], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 11, 0, 0, 0, -11], [0, 0, 0, 0, 0, 0, 0, 0], [17, -1, -17, 17, 1, -1, 1, -16], [0, 0, 0, 0, 0, 0, 0, 0], [31, 5, 18, 13, 0, 5, -5, -18], [23, 0, -27, 0, -4, -4, 0, 0], [-29, -7, -11, -11, 0, 7, 0, -29], [0, 0, 0, 0, 0, 0, 0, 0], [7, 0, 34, 0, -10, 20, 0, 0], [29, 0, 0, 0, 18, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [11, 0, 3, 0, 14, 14, 0, 0], [30, 0, 58, 0, 1, -2, 0, 0], [0, 0, 0, -15, 0, 0, 0, 15], [0, 0, 0, 0, 0, 0, 0, 0], [0, 22, 0, -34, 0, 0, -11, -17], [0, 0, -32, 0, 0, -15, 0, 0], [19, 0, -19, -31, 7, -7, -7, -19], [0, 16, 0, 14, 0, 0, -8, 7], [-1, -14, 1, 13, -14, 14, 0, 12], [-11, 8, 11, 11, 8, -8, -8, -19], [0, 0, 0, 0, 0, 0, 0, 0], [-15, -7, -15, 22, 7, 7, 14, 7], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [-18, 0, -25, -25, -11, 0, 11, -7], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_663_bp_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_663_2_bp_a();".
// 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_663_2_bp_a(:prec:=8)
    chi := MakeCharacter_663_bp();
    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_663_2_bp_a();".
// 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_663_2_bp_a( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_663_bp();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<2,R![0, 1]>,<5,R![676, 1872, 2592, 948, 173, 6, 18, 6, 1]>],Snew);
    return Vf;
end function;