
// Make newform 280.2.q.d in Magma, downloaded from the LMFDB on 23 September 2025.
// To make the character of type GrpDrchElt, type "MakeCharacter_280_q();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_280_q_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_280_2_q_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_280_2_q_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 := [4, 0, 2, 0, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, 1, 0], [0, 0, 0, 1]];
    Rf_basisdens := [1, 1, 2, 2];
    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_280_q();"
function MakeCharacter_280_q()
    N := 280;
    order := 3;
    char_gens := [71, 141, 57, 241];
    v := [3, 3, 3, 2];
    // 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_280_q_Hecke();"
function MakeCharacter_280_q_Hecke( : Kf := false)
    N := 280;
    order := 3;
    char_gens := [71, 141, 57, 241];
    char_values := [[1, 0, 0, 0], [1, 0, 0, 0], [1, 0, 0, 0], [0, 0, 1, 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, 0], [1, 1, 1, 0], [0, 0, 1, 0], [-1, 1, -1, 2], [2, 2, 2, 0], [2, 0, 0, 0], [2, -4, 2, 0], [0, 4, 0, 4], [0, -1, -7, -1], [-5, 0, 0, -2], [2, 2, 2, 0], [0, -4, 0, -4], [3, 0, 0, 2], [3, 0, 0, -7], [0, -4, 6, -4], [0, -4, 0, 0], [4, 0, 4, 0], [0, -4, 1, -4], [3, -7, 3, 0], [-12, 0, 0, 0], [2, 4, 2, 0], [0, 0, -4, 0], [-9, 0, 0, 3], [0, -4, -11, -4], [6, 0, 0, 0], [3, -6, 3, 0], [0, 1, 9, 1], [0, -1, -7, -1], [-7, 8, -7, 0], [0, 0, 0, 8], [-10, 0, 0, 4], [0, -4, 8, -4], [4, 0, 4, 0], [-6, 0, 0, 6], [0, -4, -1, -4], [14, 2, 14, 0], [10, 8, 10, 0], [0, 4, -10, 4], [-5, 0, 0, 5], [0, 4, 16, 4], [-2, -6, -2, 0], [-7, 0, 0, 2], [0, -6, -14, -6], [-6, -8, -6, 0], [6, 0, 0, -4], [12, -8, 12, 0], [4, 0, 0, 16], [2, 0, 0, -12], [-14, 0, -14, 0], [0, 0, -14, 0], [0, -4, 6, -4], [-22, 0, 0, -6], [10, 0, 10, 0], [-2, 0, 0, -18], [0, -8, 4, -8], [3, -9, 3, 0], [1, -4, 1, 0], [0, 8, 8, 8], [-6, 16, -6, 0], [14, 0, 0, -8], [-18, 0, -18, 0], [0, 0, 0, 12], [9, 0, 0, -3], [-16, 4, -16, 0], [0, -12, 4, -12], [0, 0, -22, 0], [0, -6, 18, -6], [8, 0, 0, 12], [7, 13, 7, 0], [7, 0, 0, 2], [-28, 4, -28, 0], [0, 6, 2, 6], [-23, -1, -23, 0], [0, 0, 12, 0], [16, 0, 0, -8], [0, 7, 9, 7], [6, 8, 6, 0], [0, 16, -2, 16], [0, 8, -21, 8], [11, -10, 11, 0], [-4, 0, 0, -8], [33, 0, 0, -4], [-2, -2, -2, 0], [-8, 0, 0, -8], [0, -4, -24, -4], [0, -1, -17, -1], [1, 0, 0, -6], [0, -12, 12, -12], [-10, 0, 0, 8], [5, 0, 0, 7], [0, 19, -11, 19], [10, 6, 10, 0], [10, -20, 10, 0], [10, 0, 0, -6], [0, -10, 30, -10], [-11, 0, 0, 5], [0, 6, -25, 6], [-14, 16, -14, 0], [0, -24, -6, -24], [0, 6, -15, 6], [-15, 0, 0, 9], [6, -8, 6, 0], [-3, -5, -3, 0], [0, 16, -14, 16], [4, -12, 4, 0], [-6, -20, -6, 0], [-34, 0, 0, 8], [0, -24, -4, -24], [-20, 16, -20, 0], [-34, 0, 0, 0], [0, -3, 23, -3], [-22, 12, -22, 0], [-24, 0, 0, 8], [-14, 18, -14, 0], [-10, 0, 0, 6], [17, 22, 17, 0], [26, 0, 0, 0], [25, 3, 25, 0], [0, 4, -10, 4], [24, 0, 0, -8], [39, -8, 39, 0], [0, 0, 0, -4], [0, -12, 6, -12], [9, 5, 9, 0], [0, 26, -6, 26], [-11, 0, 0, 0], [0, 30, 7, 30], [0, 14, -6, 14], [31, 0, 0, 5], [0, -4, 2, -4], [-14, 2, -14, 0], [-15, 0, 0, 3], [0, 0, -12, 0], [6, 0, 0, 0], [0, 24, -10, 24], [-2, 0, 0, 32], [-30, -4, -30, 0], [3, 1, 3, 0], [-24, 0, 0, -8], [19, -12, 19, 0], [38, 0, 0, 10], [0, 16, -10, 16], [11, 29, 11, 0], [-19, 0, 0, 23], [6, 8, 6, 0], [6, 0, 0, 10], [24, 0, 0, -8], [2, -12, 2, 0], [0, 16, -8, 16], [0, 29, -15, 29], [0, 20, 0, 20], [-1, 0, 0, -18], [18, 0, 0, -8], [0, 1, 19, 1], [-25, 15, -25, 0], [-10, 0, 0, -6], [0, 32, 12, 32], [0, 14, 29, 14], [-4, 0, 0, 16], [10, 0, 10, 0], [0, 7, 21, 7], [-32, 0, 0, -16], [-29, 0, 0, 3], [0, 0, 8, 0], [-2, 20, -2, 0], [23, -13, 23, 0], [-2, 2, -2, 0], [20, 4, 20, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_280_q_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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