
// Make newform 546.2.o.d in Magma, downloaded from the LMFDB on 19 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_546_o();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_546_o_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_546_2_o_d();".
// 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_546_2_o_d();".
// 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 := [324, 0, 540, 0, 205, 0, 26, 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], [-162, 612, 219, 374, 60, 52, 3, 2], [-810, 774, -249, 155, 24, -8, 3, -1], [162, 612, -219, 374, -60, 52, -3, 2], [810, 1206, 249, 155, -24, -8, -3, -1], [0, -954, 0, -665, 0, -112, 0, -5], [114, 0, 97, 0, 20, 0, 1, 0]];
    Rf_basisdens := [1, 1, 432, 432, 432, 432, 432, 24];
    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_546_o();"
function MakeCharacter_546_o()
    N := 546;
    order := 4;
    char_gens := [365, 157, 379];
    v := [4, 2, 3];
    // 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_546_o_Hecke();"
function MakeCharacter_546_o_Hecke(Kf)
    N := 546;
    order := 4;
    char_gens := [365, 157, 379];
    char_values := [[1, 0, 0, 0, 0, 0, 0, 0], [-1, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 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 := 2;
    raw_aps := [[0, 0, -1, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 1, 0], [0, 0, 0, 0, -1, 1, -1, 1], [0, 0, 1, -1, 0, 0, 0, 1], [-1, 1, 0, 0, 1, -1, 1, 0], [-2, 0, 0, 0, 0, 0, -3, 0], [1, 0, -3, 0, 3, 0, 0, 1], [-1, -2, 0, 0, -3, 3, 0, 1], [0, 0, -2, -1, -2, -1, -2, 0], [-1, 2, 1, 2, -1, -2, 0, -1], [-2, -1, 0, 0, 0, 0, 3, -1], [-2, 1, 0, 0, -1, 1, 0, 2], [-2, 2, 0, 0, -4, -2, 2, 0], [0, 2, -2, -1, -2, -1, 4, 0], [2, 0, -2, 2, 0, 0, 2, 0], [-4, -2, 2, -2, -2, 2, 0, 2], [-3, 1, 4, 2, 0, 0, -4, -1], [0, 1, 3, 0, 3, 0, -2, 0], [1, 0, 4, 2, 0, 0, 1, 0], [7, 1, 4, 2, 0, 0, 6, -1], [2, 2, -1, 1, 0, 0, 0, -2], [-8, -3, -3, -3, 3, 3, 0, 4], [-4, -2, 0, 0, -2, 2, 4, 0], [1, 3, 0, 0, 0, 0, -2, -3], [6, -3, 0, 0, 6, 0, -3, -3], [8, 3, -3, 3, 3, -3, 0, -4], [7, -1, 4, -1, -4, 1, 0, 3], [-8, 0, 0, 0, 0, 0, 0, 4], [0, 2, 11, 1, 0, 0, -2, -2], [4, 4, -4, 4, 4, -4, 0, -6], [0, -3, 5, 1, 5, 1, 2, 0], [0, 0, 4, -1, 4, -1, 2, 0], [2, 0, 0, 0, -1, 1, -3, 1], [0, 2, -4, 4, -4, 4, -2, 0], [3, -1, -12, 0, 0, 0, 4, 1], [3, -4, 0, 0, -3, 3, -2, -1], [0, -3, -1, -2, -1, -2, 0, 0], [-1, -2, 0, 0, -6, 0, 3, -2], [5, 4, -1, 1, 0, 0, 1, -4], [4, 2, -8, 2, 8, -2, 0, -2], [0, -1, 3, -3, 3, -3, 6, 0], [-8, -2, -4, -2, 4, 2, 0, 6], [-1, 3, 0, 3, 0, -3, 0, -9], [-2, 3, 0, 0, 8, -2, 1, 1], [-3, 1, -2, 2, 0, 0, -4, -1], [-5, -1, 4, -1, -4, 1, 0, 5], [-3, -1, -2, -1, 2, 1, 0, -1], [-1, 2, 0, 0, 18, 0, -1, 2], [5, -1, 0, 0, -6, 0, -4, -1], [2, 1, 6, 0, 0, 0, 1, -1], [0, 5, -1, 1, -1, 1, -4, 0], [2, -4, 10, -10, 0, 0, 6, 4], [4, 1, 4, 2, 0, 0, 3, -1], [-7, -5, 2, -5, -2, 5, 0, 1], [-16, 4, -4, 4, 4, -4, 0, -2], [4, 0, 6, 0, -6, 0, 0, -4], [0, 3, -5, -1, -5, -1, 12, 0], [1, -4, 12, -6, 0, 0, 5, 4], [0, -1, 3, -3, 3, -3, -2, 0], [-8, 4, 0, 0, 12, -6, 10, -2], [-12, 1, 5, 1, -5, -1, 0, 8], [0, -8, -2, -4, 0, 0, 8, 8], [-10, -3, -2, 2, 0, 0, -7, 3], [10, -5, 11, -5, -11, 5, 0, 4], [0, 1, -15, 3, -15, 3, -12, 0], [16, 2, 2, 4, 0, 0, 14, -2], [-1, -4, 4, -10, 0, 0, 3, 4], [0, 1, -1, -2, -1, -2, 2, 0], [14, 6, -6, 6, 6, -6, 0, -2], [-9, -2, 6, -6, 0, 0, -7, 2], [-1, 1, 0, 0, -6, 6, -6, 7], [-3, -3, 0, 0, -2, 8, -2, 5], [0, 0, -2, 2, -2, 2, 2, 0], [12, 3, 3, 3, -3, -3, 0, -6], [4, -1, -12, 0, 0, 0, 5, 1], [-9, -1, 0, 0, 3, -3, 13, -4], [0, -2, -8, 2, -8, 2, -6, 0], [5, 4, 0, 12, 0, 0, 1, -4], [12, 2, 0, 0, -2, -4, -10, -2], [-8, -1, 0, 0, 3, 9, 0, 8], [0, -2, -10, 7, -10, 7, 6, 0], [-8, -5, 8, -2, 0, 0, -3, 5], [6, -2, 2, -2, 0, 0, 8, 2], [8, 4, -16, 4, 16, -4, 0, 0], [-7, 1, 8, 1, -8, -1, 0, -3], [-2, -8, 2, -8, -2, 8, 0, 6], [-8, -4, 0, 0, -7, 7, 5, 3], [0, -3, 20, -2, 0, 0, 3, 3], [8, 0, 0, 0, -3, 3, -11, 3], [-1, -4, 0, 0, 1, -1, 6, -5], [3, 1, -10, 1, 10, -1, 0, -9], [-1, -2, -19, -5, 0, 0, 1, 2], [10, 1, -22, -2, 0, 0, 9, -1], [0, 1, -5, -1, -5, -1, 2, 0], [9, 6, 2, 16, 0, 0, 3, -6], [0, 0, 0, 0, 0, 0, 12, 0], [4, 4, 0, 0, -5, 5, -13, 9], [0, 7, 11, -2, 11, -2, -10, 0], [0, 2, -8, 2, -8, 2, 6, 0], [-6, -1, 0, 0, -9, 9, -2, 8], [8, 12, -12, 12, 12, -12, 0, -4], [-3, -1, 0, 0, 4, 8, -4, 7], [15, 13, -4, 13, 4, -13, 0, -9], [0, 0, 14, -8, 14, -8, 6, 0], [0, 2, 10, -4, 10, -4, 4, 0], [-8, -3, 0, 0, 8, -2, 13, -5], [5, 1, 0, 0, -12, -6, 0, -5], [1, -1, -8, -4, 0, 0, 2, 1], [13, -5, -4, -5, 4, 5, 0, -3], [0, 2, -6, 0, -6, 0, 2, 0], [0, 2, -6, -3, -6, -3, -20, 0], [-6, 6, -33, 9, 0, 0, -12, -6], [-10, -1, 5, 7, 0, 0, -9, 1], [1, 5, 7, 5, 0, 0, -4, -5], [-13, -8, 0, 0, -7, 7, 14, -1], [0, -3, -11, 5, -11, 5, 0, 0], [-5, 2, 0, 0, 21, 3, 0, 5], [12, 1, -7, 1, 7, -1, 0, -6], [-1, -6, 9, -6, -9, 6, 0, 7], [-14, -2, 14, -2, -14, 2, 0, 2], [-10, -1, -20, 2, 0, 0, -9, 1], [0, 3, 17, -2, 17, -2, 8, 0], [0, -1, 1, -7, 1, -7, -12, 0], [9, -1, 0, 0, -3, 3, -11, 2], [6, 5, 0, 0, -4, -8, -3, -3], [0, 6, 0, 0, 0, 0, -14, 0], [2, -3, 0, 0, 38, 4, -3, 1], [-20, -1, 13, -1, -13, 1, 0, 2], [-27, -7, 4, -7, -4, 7, 0, 7], [10, 1, 0, 0, -28, -2, -9, -1], [7, 2, 0, 0, -6, 0, -9, 2], [9, -5, 12, -6, 0, 0, 14, 5], [0, 6, -20, 2, -20, 2, 2, 0], [20, 4, -16, 4, 16, -4, 0, 0], [-15, -3, -8, -4, 0, 0, -12, 3], [-16, -7, 0, 0, -11, 11, 12, 4], [-6, -4, 0, 0, 11, 1, 9, -3], [-13, 5, -1, 1, 0, 0, -18, -5], [-12, -5, -1, -5, 1, 5, 0, 16], [-10, 5, -5, 5, 5, -5, 0, -2], [5, 6, 0, 0, 11, -11, 0, -5], [-6, -8, 4, 2, 0, 0, 2, 8], [0, 12, -14, 8, -14, 8, -22, 0], [-1, 9, 0, 0, 3, -3, -5, 6], [7, -8, -7, -8, 7, 8, 0, 1], [0, -6, 28, -16, 0, 0, 6, 6], [-4, 1, 2, -8, 0, 0, -5, -1], [16, 2, 22, 2, -22, -2, 0, -2], [0, -1, -21, 3, -21, 3, -22, 0], [-3, 5, 20, -2, 0, 0, -8, -5], [6, 9, 20, 10, 0, 0, -3, -9], [5, -6, -3, -6, 3, 6, 0, -3], [0, 2, 4, -7, 4, -7, 2, 0], [0, -11, -1, 1, -1, 1, -6, 0], [0, 2, -10, -2, -10, -2, 16, 0], [-3, 7, -22, 7, 22, -7, 0, -15], [-30, 4, -10, 4, 10, -4, 0, -4], [-5, 5, 0, 0, 24, 0, 0, 5], [0, -15, 9, -3, 9, -3, 4, 0], [0, 4, 0, 0, 22, -4, 0, 0], [3, -1, 0, 0, -3, 3, -5, 2], [0, -3, -13, 1, -13, 1, 24, 0], [-13, 3, 7, -7, 0, 0, -16, -3], [0, 12, 8, 4, 8, 4, -12, 0], [-16, 7, -23, 11, 0, 0, -23, -7], [19, 10, 13, 11, 0, 0, 9, -10], [30, -7, 7, -7, -7, 7, 0, 4], [0, 4, -8, -4, -8, -4, 8, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_546_o_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_546_2_o_d();".
// 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_546_2_o_d(:prec:=8)
    chi := MakeCharacter_546_o();
    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_546_2_o_d();".
// 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_546_2_o_d( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_546_o();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<5,R![16, 160, 800, -424, 113, 4, 8, -4, 1]>],Snew);
    return Vf;
end function;