
// Make newform 7200.2.a.cb in Magma, downloaded from the LMFDB on 25 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_7200_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_7200_2_a_cb();".
// 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_7200_2_a_cb();".
// 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;
    Rf_num := [[1, 0], [-1, 2]];
    Rf_basisdens := [1, 1];
    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_7200_a();"
function MakeCharacter_7200_a()
    N := 7200;
    order := 1;
    char_gens := [6751, 901, 6401, 577];
    v := [1, 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_7200_a_Hecke(Kf)
    return MakeCharacter_7200_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, 0], [0, 0], [0, 0], [-3, -1], [0, 0], [0, 0], [0, 0], [0, 0], [1, 3], [6, 0], [0, 0], [0, 0], [0, -2], [-9, 1], [7, -3], [0, 0], [0, 0], [0, 6], [-3, -5], [0, 0], [0, 0], [0, 0], [-11, 3], [-6, 0], [0, 0], [18, 0], [-9, 5], [-13, -3], [0, -6], [0, 0], [-3, 7], [0, 0], [0, 0], [0, 0], [0, -2], [0, 0], [0, 0], [-9, -7], [-17, -3], [0, 0], [0, 0], [-2, 0], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0], [-21, 1], [7, 9], [-14, 0], [0, 0], [0, 0], [0, -6], [0, 0], [0, 0], [-11, -9], [0, -10], [0, 0], [0, 0], [0, 14], [-21, 5], [0, 0], [-3, 11], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0], [-17, 9], [26, 0], [0, 0], [0, 0], [-27, -1], [0, 0], [0, 0], [-19, -9], [0, 14], [0, 0], [-18, 0], [0, -18], [0, 0], [0, -18], [0, 0], [0, 0], [0, 0], [29, 3], [0, 10], [0, 0], [42, 0], [-9, 13], [23, 9], [0, 0], [-27, 7], [0, 0], [0, 0], [-31, 3], [6, 0], [-42, 0], [-21, -11], [38, 0], [33, -1], [0, 0], [1, 15], [0, -14], [0, 0], [0, 0], [7, -15], [0, 0], [0, 0], [0, 18], [33, -5], [0, 0], [0, 0], [0, 0], [0, 0], [0, 22], [-21, 13], [-13, -15], [0, 0], [0, 0], [0, -18], [0, 0], [0, 0], [-31, -9], [0, 0], [0, 10], [-46, 0], [0, 0], [-3, -17], [0, 0], [0, 0], [-19, 15], [0, 0], [0, 0], [-42, 0], [14, 0], [0, 0], [-27, -13], [0, 0], [-54, 0], [0, 0], [0, -14], [39, 5], [23, -15], [0, -6], [0, 0], [0, 0], [0, 0], [0, 0], [41, 3], [0, 0], [0, -26], [39, -7], [-37, 9], [-3, 19], [0, 0], [0, 0], [0, -22], [0, 0], [42, 0], [43, -3], [0, 0], [33, -13], [0, 0], [0, 0], [29, 15], [0, 0], [0, 0], [-34, 0], [0, 0], [0, 0], [-58, 0], [0, 0], [0, 0], [0, 0], [-54, 0], [0, 0], [18, 0], [39, -11], [0, -6], [-27, -17], [0, 0], [0, 0], [0, 0], [1, -21], [-66, 0], [0, 0], [-21, -19], [0, 30], [0, 0], [0, 0], [-11, -21], [0, 0], [0, -22], [-13, 21], [0, 0], [0, -6], [0, 0], [0, 0], [49, 3], [54, 0], [0, 0], [0, 0], [46, 0], [0, 0], [0, 0], [0, 0], [-19, -21], [-6, 0], [0, 0], [0, 0], [0, 2], [51, 1], [47, 9], [0, 0], [0, -30], [-3, 23], [-18, 0], [23, 21], [0, 0], [0, 30], [0, 0], [66, 0], [51, -7], [-53, -3], [0, 18], [0, 0], [0, 0], [33, 19], [0, 0], [0, 0], [0, 0], [0, 0], [0, -34], [39, 17], [43, -15], [0, 6], [0, 0], [0, 0], [0, 0], [29, -21], [0, 0], [-21, -23], [74, 0], [0, 0], [0, 0], [-3, -25], [0, 0], [0, 0], [-31, -21], [0, 0], [78, 0], [-53, 9], [0, 30], [0, 0], [0, 0], [-2, 0], [57, -1], [0, 0], [0, 0], [39, -19], [47, -15], [-14, 0], [0, 0], [0, 0], [0, 0], [54, 0], [-42, 0], [51, 13], [0, 0], [22, 0], [57, 7], [0, 0], [0, 0], [0, 0], [-21, 25], [-37, 21], [26, 0], [0, -30], [0, 0], [1, 27], [0, 0], [7, -27], [-82, 0], [33, 23], [0, 0], [0, 0], [0, 0], [0, 0], [0, 10], [0, -22], [-13, -27], [0, 0], [0, 0], [0, 0], [0, 38], [0, 0], [0, 0], [0, 0], [-63, -1], [0, 0], [0, 0], [0, 0], [-19, 27], [0, 0], [0, 0], [43, 21], [-86, 0], [0, 0], [0, 0], [61, -9], [-66, 0], [-18, 0], [39, -23], [23, -27], [-74, 0], [0, 0], [0, 0], [0, 0], [0, -38], [0, 0], [0, 0], [0, 26], [-9, 29], [0, 0], [0, -6], [0, 0], [51, -19], [47, 21], [0, 0], [0, -42], [0, 0], [0, 0], [29, 27], [0, 0], [67, -3], [0, 42], [0, 0], [0, -30], [-63, 11], [0, 0], [0, 0], [0, -2], [0, 0], [0, 0], [0, 0], [0, -18], [57, -17], [0, 0], [0, 0], [0, 0], [0, 0], [0, -38], [-69, 1], [-94, 0], [0, 0], [0, 0], [0, 0], [0, 0], [61, 15], [0, 0], [-42, 0], [67, 9], [0, 0], [-27, -29], [0, 0], [0, 0], [-69, -7], [0, 18], [0, 0], [0, 0], [-71, 3], [0, 14], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0], [0, 26], [0, 0], [-102, 0], [0, 0], [33, -29], [0, 0], [0, 0], [41, 27], [0, 0], [0, 0], [-69, -11], [-73, -3], [0, -42], [0, 0], [0, 0], [-63, -17], [0, 0], [0, 0], [0, 0], [-54, 0], [0, 0], [0, 34], [0, -6], [0, 0], [-27, 31], [0, 0], [0, 46], [0, 0], [0, 0], [78, 0], [-69, 13], [0, 0], [0, 0], [0, 0], [-59, -21], [0, 0], [0, 0], [42, 0], [0, 0], [-63, 19], [0, 0], [-19, -33], [0, 22], [0, 0], [47, -27], [0, 0], [0, 0], [0, 0], [61, -21], [0, -46], [0, 0], [0, 0]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_7200_a_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_7200_2_a_cb();".
// 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_7200_2_a_cb(:prec:=2)
    chi := MakeCharacter_7200_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(2999) - 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_7200_2_a_cb();".
// 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_7200_2_a_cb( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_7200_a();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<7,R![4, 6, 1]>,<11,R![0, 1]>,<13,R![0, 1]>,<17,R![0, 1]>,<19,R![0, 1]>,<23,R![-44, -2, 1]>],Snew);
    return Vf;
end function;