
// Make newform 290.2.j.b in Magma, downloaded from the LMFDB on 01 May 2026.
// To make the character of type GrpDrchElt, type "MakeCharacter_290_j();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_290_j_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_290_2_j_b();".
// 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_290_2_j_b();".
// 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, 0, 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_290_j();"
function MakeCharacter_290_j()
    N := 290;
    order := 4;
    char_gens := [117, 31];
    v := [3, 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_290_j_Hecke();"
function MakeCharacter_290_j_Hecke( : Kf := false)
    N := 290;
    order := 4;
    char_gens := [117, 31];
    char_values := [[0, 1], [0, 1]];
    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, 1], [2, 0], [-1, -2], [3, 3], [-1, -1], [5, 5], [0, -2], [3, -3], [1, -1], [-5, -2], [-7, -7], [-4, 0], [-3, 3], [-6, 0], [-2, 0], [7, -7], [0, 14], [-1, -1], [-3, 3], [0, -6], [0, -10], [9, -9], [-1, 1], [-1, 1], [0, 0], [11, 11], [-3, 3], [1, 1], [14, 0], [0, -2], [0, 8], [1, -1], [0, 6], [0, 14], [-6, 0], [0, -14], [8, 0], [0, 4], [-5, 5], [1, 1], [-20, 0], [-10, 0], [13, 13], [20, 0], [-5, -5], [0, -10], [-7, 7], [5, -5], [9, 9], [-3, -3], [1, -1], [0, 6], [0, -4], [-13, -13], [-15, -15], [-30, 0], [-11, -11], [3, -3], [3, 3], [6, 0], [19, 19], [24, 0], [0, 4], [1, 1], [13, -13], [28, 0], [1, -1], [-16, 0], [-3, 3], [0, -20], [-1, -1], [-7, 7], [0, -24], [-5, 5], [-17, 17], [17, 17], [9, 9], [15, 15], [34, 0], [-9, 9], [-28, 0], [-9, 9], [40, 0], [0, 34], [-8, 0], [0, -12], [23, -23], [-17, 17], [-1, 1], [-15, -15], [0, -20], [-1, -1], [-9, -9], [-19, 19], [28, 0], [0, 24], [0, 20], [0, -28], [7, -7], [23, 23], [-3, -3], [5, -5], [0, 4], [15, 15], [-28, 0], [20, 0], [-23, -23], [-25, -25], [9, -9], [9, 9], [14, 0], [9, 9], [32, 0], [-3, -3], [0, 10], [-31, -31], [-5, -5], [15, -15], [0, 34], [-25, 25], [-10, 0], [-13, -13], [0, 0], [-29, 29], [20, 0], [0, 48], [38, 0], [0, -2], [0, 16], [0, -34], [3, -3], [0, -16], [-29, 29], [0, -26], [38, 0], [-21, -21], [20, 0], [13, -13], [0, -18], [11, 11], [0, -14], [0, 16], [-30, 0], [-18, 0], [-27, 27], [11, 11], [0, -42], [-7, -7], [-15, -15], [9, 9], [-37, -37], [-19, -19], [3, 3], [0, -16], [-34, 0], [-21, 21], [0, -50], [0, -24], [39, -39], [0, 48], [0, 12], [-7, 7], [6, 0], [-13, -13], [9, 9], [0, -8], [0, -30], [0, -10]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_290_j_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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