
// Make newform 182.2.f.c in Magma, downloaded from the LMFDB on 25 September 2025.
// To make the character of type GrpDrchElt, type "MakeCharacter_182_f();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_182_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_182_2_f_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_182_2_f_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 := [21, -57, 102, -102, 82, -40, 18, -4, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0, 0, 0, 0, 0], [3, -1, 1, 0, 0, 0, 0, 0], [119, -92, -166, 336, -233, 138, -35, 10], [-140, 387, -515, 504, -255, 130, -28, 8], [77, -202, 509, -434, 282, -138, 35, -10], [-511, 841, -1038, 497, -278, 37, -14, -3], [469, -776, 1118, -630, 408, -110, 35, -3], [-336, 905, -1208, 1190, -640, 333, -77, 22]];
    Rf_basisdens := [1, 1, 49, 49, 49, 49, 49, 49];
    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_182_f();"
function MakeCharacter_182_f()
    N := 182;
    order := 3;
    char_gens := [157, 15];
    v := [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_182_f_Hecke();"
function MakeCharacter_182_f_Hecke( : Kf := false)
    N := 182;
    order := 3;
    char_gens := [157, 15];
    char_values := [[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 := ISA(Type(Kf), Fld), 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]];
    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, 1, 0, 0, 0, 0], [0, -1, 0, 0, 0, 0, 0, -1], [0, 0, -1, 1, 0, -1, -1, 1], [1, 0, 0, 0, 0, 0, 1, 0], [0, 1, -1, 0, 1, -1, 0, 1], [-1, 0, 0, 0, 0, 0, 0, 0], [-1, 1, -1, -1, 0, 0, 1, 1], [0, 0, 1, 0, 1, 2, 1, 1], [0, 0, 0, 2, 0, 0, 0, -2], [4, -1, 0, 0, 0, 1, -1, 0], [-1, 1, 1, -1, 1, -1, -2, 1], [0, 0, 0, 0, 0, 0, 0, 1], [-2, -2, 2, 0, 2, 0, 0, 0], [3, 3, 1, 0, 1, 0, 0, 0], [0, 0, 0, -1, -1, -1, 0, -1], [0, -1, -1, 0, -1, 1, 2, -1], [-4, 3, -1, -4, 1, -1, 0, 3], [0, 0, 1, -2, 1, 2, 1, -3], [0, 1, -1, 0, 1, -1, 0, 1], [1, -1, -1, 0, -1, 1, -1, 0], [-4, 2, 2, -4, -2, 2, 0, 2], [0, 0, -2, 4, 2, 0, -2, -2], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, -2, 2, 2, 0, -2, -2], [0, 2, 2, 0, 2, 0, 0, 0], [-10, 0, 0, -10, 0, 0, 0, 0], [0, 0, 4, -2, -2, 2, 4, -4], [0, 0, 1, -7, 1, 2, 1, -3], [-5, -5, 0, -5, -5, 5, 5, -5], [1, 0, -4, 0, -4, -4, 4, 0], [-8, 0, -4, 0, -4, -2, 2, 0], [0, 0, -1, -5, 0, -1, -1, 3], [4, 0, 2, 4, 4, -4, -6, 0], [1, 4, -1, 0, -1, -2, 2, 0], [0, 0, 1, 3, 1, 2, 1, 3], [-5, 3, 1, -5, 0, 0, -1, 3], [8, -1, -1, 8, 1, -1, 0, -1], [0, 0, -1, -4, -1, -2, -1, -3], [3, 6, 0, 0, 0, 0, 0, 0], [0, 0, -3, -8, 1, -2, -3, 3], [5, 1, 0, 5, -5, 5, 5, 1], [12, -5, 0, 0, 0, 3, -3, 0], [0, 0, 0, 0, -2, -2, 0, 0], [-8, -6, 0, -8, 0, 0, 0, -6], [-1, -3, -1, 0, -1, 2, -2, 0], [14, 2, 2, 14, 4, -4, -6, 2], [5, 2, 3, 0, 3, 0, 0, 0], [6, -2, -4, 0, -4, -5, 5, 0], [-12, -2, 2, -12, -4, 4, 2, -2], [0, 0, 2, 0, 2, 4, 2, -3], [0, 0, -7, 6, 3, -4, -7, 4], [-2, 4, 0, 0, 0, -1, 1, 0], [10, 0, 0, 10, 2, -2, -2, 0], [-11, -1, -2, 0, -2, 1, -1, 0], [0, 0, 5, -3, -4, 1, 5, -1], [8, 4, 2, 8, 0, 0, -2, 4], [-2, -1, -3, -2, -1, 1, 4, -1], [0, 0, 6, 7, -3, 3, 6, -6], [2, -7, -1, 2, 3, -3, -2, -7], [10, -6, -4, 0, -4, -2, 2, 0], [12, 2, -2, 12, 6, -6, -4, 2], [8, -1, 0, 0, 0, 2, -2, 0], [2, 3, 0, 0, 0, 3, -3, 0], [-12, -2, 2, -12, -4, 4, 2, -2], [0, 0, -1, -9, 4, 3, -1, 4], [0, 0, -3, -1, 1, -2, -3, -1], [0, 0, 0, 16, -2, -2, 0, 4], [-9, -4, -5, 0, -5, 1, -1, 0], [7, -8, 6, 7, -1, 1, -5, -8], [11, 8, 3, 0, 3, 2, -2, 0], [4, 10, -2, 4, 2, -2, 0, 10], [0, 0, -5, -5, 3, -2, -5, 1], [22, -4, 2, 22, -4, 4, 2, -4], [0, 0, 1, 20, 1, 2, 1, -5], [-2, -4, -2, 0, -2, -4, 4, 0], [0, 0, 2, 2, 0, 2, 2, -7], [-4, -5, -1, -4, 3, -3, -2, -5], [0, 0, -1, 5, -1, -2, -1, 5], [0, 0, 2, 0, -4, -2, 2, 4], [-4, 8, -4, -4, 8, -8, -4, 8], [-11, -7, 7, 0, 7, 4, -4, 0], [9, 7, -3, 0, -3, -2, 2, 0], [-11, 7, 0, -11, 5, -5, -5, 7], [2, 6, 8, 0, 8, -3, 3, 0], [0, 0, -4, -2, 0, -4, -4, -2], [0, 0, 4, -4, -4, 0, 4, 1], [4, 4, 0, 0, 0, 0, 0, 0], [0, 0, -2, 12, 2, 0, -2, 0], [-17, -2, -9, 0, -9, -4, 4, 0], [1, -9, -6, 0, -6, 3, -3, 0], [0, 0, 2, 20, 2, 4, 2, 2], [6, 6, -1, 6, 5, -5, -4, 6], [7, -12, -2, 7, -2, 2, 4, -12], [-1, -1, 5, 0, 5, 0, 0, 0], [0, 0, 0, 8, -4, -4, 0, -6], [-4, 2, -4, 0, -4, 0, 0, 0], [0, 0, 2, -6, -6, -4, 2, 2], [-6, -1, -2, -6, 4, -4, -2, -1], [0, 0, -3, -25, 1, -2, -3, -3], [0, 0, 7, 5, 4, 11, 7, 6], [-16, 3, 0, 0, 0, 2, -2, 0], [-20, -5, 2, -20, -2, 2, 0, -5], [1, 3, -2, 1, 1, -1, 1, 3], [0, 0, 4, 3, -7, -3, 4, -11], [-16, 3, 0, -16, 4, -4, -4, 3], [-8, -8, 0, -8, 2, -2, -2, -8], [-2, 1, 2, 0, 2, 5, -5, 0], [0, 0, -6, -6, 2, -4, -6, 0], [6, 0, 6, 6, 2, -2, -8, 0], [-14, 0, 4, 0, 4, 5, -5, 0], [0, 0, -2, -12, 4, 2, -2, 6], [-3, -13, 3, -3, -5, 5, 2, -13], [18, 10, 12, 0, 12, 4, -4, 0], [-22, -6, -6, -22, -6, 6, 12, -6], [14, 5, 2, 0, 2, 0, 0, 0], [15, 9, -1, 15, 7, -7, -6, 9], [18, 1, -2, 0, -2, 1, -1, 0], [-6, -8, 2, -6, -8, 8, 6, -8], [0, 0, 4, 2, 2, 6, 4, 2], [-3, 5, 10, 0, 10, -1, 1, 0], [-3, -1, 7, -3, -1, 1, -6, -1], [-3, -8, -5, 0, -5, 0, 0, 0], [0, 0, 3, -12, -9, -6, 3, 5], [-8, -12, 2, -8, -12, 12, 10, -12], [0, 0, -1, -16, 1, 0, -1, -1], [20, 2, 2, 0, 2, -4, 4, 0], [0, 0, -4, -2, 0, -4, -4, 8], [0, 0, 2, -8, -6, -4, 2, -2], [2, -2, -4, 0, -4, 6, -6, 0], [0, 0, 1, -3, 6, 7, 1, 8], [-12, 10, -4, -12, 8, -8, -4, 10], [-9, -15, 1, 0, 1, 3, -3, 0], [0, 0, 0, 28, 2, 2, 0, 2], [4, -1, 6, 0, 6, 5, -5, 0], [0, 0, 8, 4, -2, 6, 8, -10], [0, 8, 4, 0, 4, 2, -2, 0], [-12, -11, 2, -12, -6, 6, 4, -11], [16, -3, -3, 16, 3, -3, 0, -3], [2, -4, 2, 0, 2, 2, -2, 0], [14, 2, -1, 14, 9, -9, -8, 2], [6, 0, 2, 0, 2, 0, 0, 0], [0, 0, 0, 0, -4, -4, 0, 13], [14, 8, 0, 14, -2, 2, 2, 8], [4, -7, -8, 0, -8, -5, 5, 0], [-2, -13, 5, -2, -9, 9, 4, -13], [21, -2, 4, 0, 4, 4, -4, 0], [12, 5, 4, 0, 4, 6, -6, 0], [-10, -5, -3, -10, -3, 3, 6, -5], [0, 0, 9, -15, 5, 14, 9, -7], [0, 0, 2, -2, 8, 10, 2, -1], [0, 0, 1, 11, -4, -3, 1, -1], [-10, -5, 10, 0, 10, 6, -6, 0], [-8, 1, 0, 0, 0, 0, 0, 0], [0, 0, -10, 12, 0, -10, -10, 4], [7, 2, -8, 7, 9, -9, -1, 2], [10, 6, -8, 0, -8, -8, 8, 0], [0, 0, 6, -8, 2, 8, 6, 8], [0, 0, -4, -14, 10, 6, -4, 14], [3, 4, -8, 0, -8, -4, 4, 0], [19, 2, 0, 19, 7, -7, -7, 2], [0, 0, 3, -14, 5, 8, 3, -17], [-17, 1, -1, 0, -1, -1, 1, 0], [13, -6, 11, 0, 11, 5, -5, 0], [0, 0, -7, 19, -2, -9, -7, 0], [-20, -12, 0, -20, -10, 10, 10, -12], [-2, -12, 5, -2, -1, 1, -4, -12], [-24, -6, 4, -24, -8, 8, 4, -6], [26, 5, -5, 26, -3, 3, 8, 5]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_182_f_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_182_2_f_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_182_2_f_c(:prec:=8)
    chi := MakeCharacter_182_f();
    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_182_2_f_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_182_2_f_c( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_182_f();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<3,R![144, -36, 117, 27, 69, 6, 9, 0, 1]>],Snew);
    return Vf;
end function;