
// Make newform 483.2.a.g in Magma, downloaded from the LMFDB on 25 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_483_a();"
// To make the coeffs of the qexp of the newform in the Hecke field type "qexpCoeffs();"
// To make the newform (type ModFrm), type "MakeNewformModFrm_483_2_a_g();".
// 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_483_2_a_g();".
// 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, -1, 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_483_a();"
function MakeCharacter_483_a()
    N := 483;
    order := 1;
    char_gens := [323, 346, 442];
    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;

function MakeCharacter_483_a_Hecke(Kf)
    return MakeCharacter_483_a();
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, 1], [-1, 0], [-1, -1], [1, 0], [1, -2], [-2, -3], [-3, 4], [-7, 2], [1, 0], [1, 6], [-5, 0], [-3, -4], [5, -6], [-4, 7], [4, -2], [-3, 1], [-3, 3], [-6, 5], [-5, 3], [10, 1], [-1, 4], [1, -8], [3, -8], [-12, 7], [-11, 10], [-13, 5], [0, -4], [4, -3], [7, -13], [1, -5], [-14, 7], [7, -12], [-7, -8], [15, 3], [8, -14], [8, -6], [2, -10], [5, -17], [5, 4], [-21, 6], [-1, 13], [1, -10], [12, 6], [-2, -10], [-14, -7], [5, -9], [15, 0], [7, 7], [-9, 15], [-17, 7], [-1, 5], [-5, -1], [19, 6], [-22, 6], [20, 6], [5, 0], [2, -3], [-1, -10], [-16, 23], [14, -22], [3, 7], [-16, 4], [13, 8], [6, 1], [-8, 4], [-27, 3], [-2, 8], [-4, -9], [19, -14], [21, -17], [9, -22], [5, 11], [8, -25], [-23, 16], [-8, -8], [-11, 4], [-7, 18], [12, 2], [23, -10], [1, 14], [5, 9], [22, -7], [28, -5], [-6, 18], [-5, -8], [-4, 0], [21, -5], [-15, -11], [11, -3], [-21, 22], [-7, 16], [17, -14], [21, -2], [20, 5], [-5, 11], [-13, -5], [16, 6], [-10, 4], [-6, 24], [-20, -2], [-25, -1], [-14, -2], [-6, 9], [-24, 32], [7, -32], [2, -12], [-12, 9], [-34, 6], [32, -15], [-15, 17], [-10, 1], [-29, 14], [26, -19], [-24, 15], [-37, 2], [-28, 1], [-8, -17], [-1, -5], [-29, 5], [-15, 22], [13, 10], [17, -8], [-6, -11], [37, -6], [-14, 11], [-25, 11], [-8, 7], [13, 6], [-29, 2], [10, -30], [-33, 12], [5, -33], [-29, 5], [-25, 12], [44, -16], [22, -42], [-15, 34], [5, 11], [0, 6], [-8, -9], [-7, 30], [16, 6], [21, 21], [-21, 3], [19, -26], [-12, -15], [-34, 14], [18, -42], [-6, -12], [18, -22], [-24, 4], [-22, 30], [-4, -19], [18, -7], [-5, -7], [-28, 6], [-25, 38], [3, 19], [-1, -20], [4, -24], [18, -40], [2, 29], [-10, -4], [-6, -5], [20, 21], [-27, -20], [14, -7], [23, -30]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_483_a_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_483_2_a_g();".
// 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_483_2_a_g(:prec:=2)
    chi := MakeCharacter_483_a();
    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_483_2_a_g();".
// 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_483_2_a_g( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_483_a();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<2,R![-1, -1, 1]>,<5,R![1, 3, 1]>],Snew);
    return Vf;
end function;