
// Make newform 210.2.m.a in Magma, downloaded from the LMFDB on 24 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_210_m();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_210_m_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_210_2_m_a();".
// 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_210_2_m_a();".
// 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 := [64, 0, 176, 0, 97, 0, 18, 0, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0, 0, 0, 0, 0, 0], [-16, 104, 74, 89, 28, 18, 2, 1], [64, 248, 72, 105, 8, 18, 0, 1], [16, 104, -74, 89, -28, 18, -2, 1], [-64, 248, -72, 105, -8, 18, 0, 1], [0, -168, 0, -179, 0, -46, 0, -3], [-336, -120, -358, -15, -92, 10, -6, 1], [336, -120, 358, -15, 92, 10, 6, 1]];
    Rf_basisdens := [1, 64, 64, 64, 64, 64, 64, 64];
    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_210_m();"
function MakeCharacter_210_m()
    N := 210;
    order := 4;
    char_gens := [71, 127, 31];
    v := [4, 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_210_m_Hecke();"
function MakeCharacter_210_m_Hecke(Kf)
    N := 210;
    order := 4;
    char_gens := [71, 127, 31];
    char_values := [[1, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, -1, 0, 0], [-1, 0, 0, 0, 0, 0, 0, 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, 0, 1, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0, 0], [0, 1, 0, 0, 1, 1, 0, 0], [1, 1, 0, 0, 0, -1, 1, 0], [0, 0, -1, 0, 1, 0, -1, 1], [-2, 0, 0, 2, 0, 2, 0, 0], [1, -2, -1, -1, 0, 1, -1, 0], [-2, 1, 0, -1, 0, 0, -1, 1], [2, 1, 1, 1, -1, 2, 1, 1], [0, 2, 2, 2, 2, 4, -1, -1], [0, 1, 0, 1, 0, -4, 1, 1], [-3, -1, 0, -2, -1, 3, 0, -1], [0, -3, -1, -3, -1, 0, 1, 1], [2, -1, 3, 3, 1, 2, 3, -1], [4, -1, 1, 1, 1, 4, 1, -1], [-2, 1, -1, -1, -1, -2, -1, 1], [0, 4, 2, -4, -2, 0, -1, 1], [0, -2, -2, -2, -2, -6, 0, 0], [0, 1, -1, 1, 1, 0, 1, 1], [2, -5, 2, 5, -2, 0, 1, -1], [-4, 2, -1, -3, 2, 4, 1, 2], [0, 5, -1, 5, -1, 0, -1, -1], [-2, -1, 1, 5, -1, 2, -1, -1], [-6, -4, 0, 4, 0, 0, 2, -2], [-2, -1, 2, 2, 1, -2, 2, -1], [0, 1, -3, 1, -3, -2, -2, -2], [4, 1, -2, 0, 1, -4, 2, 1], [4, -1, 1, -5, -1, -4, -1, -1], [0, -1, -3, -1, -3, -4, 1, 1], [-2, 4, 0, 0, 2, -2, 0, -2], [-4, 0, -1, 11, 0, 4, 1, 0], [0, 7, 3, 7, 3, -4, 2, 2], [-2, 0, -2, 4, 0, 2, 2, 0], [10, -3, 0, 3, 0, 0, 1, -1], [0, -2, 0, -2, 0, 4, -1, -1], [0, -4, 2, 4, -2, 0, 0, 0], [6, -10, 4, 4, 0, 6, 4, 0], [-2, -11, -1, -1, -1, -2, -1, 1], [-10, 1, -1, -1, -1, -10, -1, 1], [11, 1, 0, 0, 1, -11, 0, 1], [0, -6, 1, -6, 1, 4, -1, -1], [0, -6, 0, -6, 0, 10, -4, -4], [-14, 1, 2, -1, -2, 0, -1, 1], [5, 4, 4, 4, 0, 5, 4, 0], [-2, 3, -1, -7, 3, 2, 1, 3], [0, 7, 0, -7, 0, 0, -1, 1], [0, 10, -2, -10, 2, 0, 2, -2], [0, -2, -5, 7, -2, 0, 5, -2], [2, 0, -2, -2, -4, 2, -2, 4], [2, -8, 0, 8, 0, 0, 0, 0], [2, 2, -4, -4, 0, 2, -4, 0], [0, 2, -3, 2, -3, -2, 2, 2], [0, 3, 5, 3, 5, 4, -1, -1], [0, -1, 3, -1, 3, 16, 0, 0], [11, 6, -1, -1, 4, 11, -1, -4], [4, 2, 0, 0, 2, 4, 0, -2], [-2, 12, 0, -12, 0, 0, 1, -1], [0, 0, -1, 0, -1, -12, -6, -6], [7, -1, 2, 0, -1, -7, -2, -1], [-2, 2, -4, -2, 4, 0, -4, 4], [4, 4, -2, 10, 4, -4, 2, 4], [-11, 2, 1, -3, 2, 11, -1, 2], [-6, 13, -5, -5, 3, -6, -5, -3], [0, 0, 2, 0, 2, 4, 2, 2], [4, -2, 1, -5, -2, -4, -1, -2], [8, 2, -2, 12, 2, -8, 2, 2], [-4, 4, -4, -4, 4, 0, 2, -2], [7, 4, 0, 4, 4, -7, 0, 4], [-4, -1, 7, -5, -1, 4, -7, -1], [6, 0, 0, 0, 0, 0, 6, -6], [11, -1, 0, -6, -1, -11, 0, -1], [0, 2, -1, 2, -1, -10, 0, 0], [-4, -17, -4, -4, -1, -4, -4, 1], [-7, 0, 1, 1, 2, -7, 1, -2], [0, -10, -4, -10, -4, -4, 2, 2], [2, -1, -3, -9, -1, -2, 3, -1], [0, 4, 2, 4, 2, 24, 1, 1], [16, 12, 2, 2, 2, 16, 2, -2], [-2, -14, 2, 14, -2, 0, 0, 0], [-12, -1, 1, 1, -1, 0, 1, -1], [4, -2, 4, 2, -4, 0, -3, 3], [0, 13, 1, -13, -1, 0, -5, 5], [-2, 11, 0, -11, 0, 0, -5, 5], [2, 2, 3, -15, 2, -2, -3, 2], [-4, -3, 6, 3, -6, 0, 5, -5], [0, 15, 3, 3, 3, 0, 3, -3], [0, 2, 2, 2, 2, 2, 0, 0], [-11, 0, 0, -8, 0, 11, 0, 0], [0, 10, 2, 10, 2, -4, 1, 1], [-4, -1, 4, 4, -5, -4, 4, 5], [10, 7, 1, 1, -5, 10, 1, 5], [-4, 2, 0, -2, 0, 0, 0, 0], [-4, 2, 3, -13, 2, 4, -3, 2], [-4, -10, -1, 10, 1, 0, 1, -1], [0, 0, 6, 0, 6, 16, 6, 6], [2, -3, -1, -3, -3, -2, 1, -3], [4, -11, 7, 11, -7, 0, 4, -4], [0, -12, -4, -12, -4, -14, -2, -2], [6, -3, 7, 1, -3, -6, -7, -3], [6, 2, -6, -2, 6, 0, 0, 0], [8, -7, 1, 3, -7, -8, -1, -7], [8, -5, -7, -5, -5, -8, 7, -5], [-12, 4, 0, 12, 4, 12, 0, 4], [0, 0, 4, 0, 4, -2, -2, -2], [8, -4, -8, 4, 8, 0, -2, 2], [-4, 17, 6, 6, -1, -4, 6, 1], [4, 9, 5, 5, -3, 4, 5, 3], [-13, 5, 4, 10, 5, 13, -4, 5], [0, 2, -3, 2, -3, -10, 0, 0], [0, 18, -4, 18, -4, 0, 6, 6], [8, 5, -2, -2, 9, 8, -2, -9], [-1, 26, -1, -1, -4, -1, -1, 4], [0, -2, 8, -18, -2, 0, -8, -2], [-10, 17, -4, -17, 4, 0, -7, 7], [4, 9, 3, -9, -3, 0, 5, -5], [6, 6, -4, -6, 4, 0, 2, -2], [-2, -3, 3, 1, -3, 2, -3, -3], [10, -1, 3, 3, 9, 10, 3, -9], [4, -10, 0, 0, 8, 4, 0, -8], [0, 16, -1, 16, -1, 0, 1, 1], [0, -16, 0, -16, 0, -2, -2, -2], [11, 0, -4, -4, 4, 11, -4, -4], [-3, -8, -3, -3, -8, -3, -3, 8], [-8, -18, 2, 2, -2, -8, 2, 2], [0, 20, 7, 20, 7, 10, 4, 4], [16, -5, 5, 5, -5, 0, 0, 0], [0, -13, 5, -13, 5, -8, -5, -5], [12, 8, 4, -8, -4, 0, -8, 8], [-8, -9, 6, 6, -5, -8, 6, 5], [8, 2, -2, -4, 2, -8, 2, 2], [0, 6, 0, 6, 0, -12, 4, 4], [8, 0, 12, 12, 0, 8, 12, 0], [16, -5, 5, 5, -5, 0, 7, -7], [-7, -3, 10, 12, -3, 7, -10, -3], [0, -15, -5, -15, -5, 12, -9, -9], [4, 24, -2, -24, 2, 0, 0, 0], [-1, 5, -8, 12, 5, 1, 8, 5], [-2, 3, -5, -5, -7, -2, -5, 7], [3, -12, -5, -5, 4, 3, -5, -4], [0, -4, -2, -4, -2, 22, 0, 0], [0, -2, 5, -2, 5, 2, -4, -4], [-12, 11, -7, -11, 7, 0, 2, -2], [4, -3, -4, -4, -7, 4, -4, 7], [-8, 0, 2, 24, 0, 8, -2, 0], [18, -12, 6, 12, -6, 0, 2, -2], [8, 10, -8, -10, 8, 0, -2, 2], [12, -10, -6, -4, -10, -12, 6, -10], [5, -32, 1, 1, 2, 5, 1, -2], [-2, 9, -2, -9, 2, 0, 5, -5], [2, -11, 5, 5, -1, 2, 5, 1], [-9, 5, 2, 16, 5, 9, -2, 5], [0, -6, -2, -6, -2, -2, -8, -8], [12, -25, 3, 3, -3, 12, 3, 3], [-16, 3, -1, -1, 5, -16, -1, -5], [8, -5, 3, -15, -5, -8, -3, -5], [26, -11, 10, 11, -10, 0, 1, -1], [0, -7, 1, -7, 1, -24, -1, -1], [4, -7, 1, 7, -1, 0, 1, -1], [2, -21, -2, -2, 5, 2, -2, -5], [0, -10, 6, -10, 6, 28, 11, 11], [8, -9, -1, 15, -9, -8, 1, -9], [8, 10, -8, -8, 0, 8, -8, 0], [18, 2, -7, -3, 2, -18, 7, 2], [0, 9, -3, 9, -3, 24, 0, 0], [2, 16, 0, 14, 16, -2, 0, 16], [0, 5, -3, 23, 5, 0, 3, 5], [20, -10, 2, 10, -2, 0, -2, 2], [12, -6, -6, -6, 8, 12, -6, -8]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_210_m_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_210_2_m_a();".
// 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_210_2_m_a(:prec:=8)
    chi := MakeCharacter_210_m();
    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_210_2_m_a();".
// 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_210_2_m_a( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_210_m();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<13,R![16, 32, 32, 8, 1]>],Snew);
    return Vf;
end function;