
// Make newform 260.2.bf.b in Magma, downloaded from the LMFDB on 24 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_260_bf();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_260_bf_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_260_2_bf_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_260_2_bf_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, 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_260_bf();"
function MakeCharacter_260_bf()
    N := 260;
    order := 12;
    char_gens := [131, 157, 41];
    v := [12, 3, 7];
    // 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_260_bf_Hecke();"
function MakeCharacter_260_bf_Hecke(Kf)
    N := 260;
    order := 12;
    char_gens := [131, 157, 41];
    char_values := [[1, 0, 0, 0], [0, 0, 0, -1], [0, 1, 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, 0], [1, -1, 0, 0], [-1, 0, 0, 2], [1, -2, -1, 4], [-3, 1, 2, 2], [3, 0, 0, -2], [-1, -1, 2, -1], [1, 1, 2, -3], [-3, 1, 4, -4], [2, 0, -1, 0], [-3, -6, 6, 3], [0, 2, -5, 2], [5, 5, 0, 0], [3, -3, -4, -1], [-4, -8, 0, 4], [-3, 4, 4, -3], [5, -5, -6, -1], [9, 0, -9, 0], [-2, 14, 1, -14], [-3, 3, 2, -1], [4, 0, -8, -8], [-2, 0, 4, -4], [-4, 8, 0, -4], [5, 9, 4, -4], [-1, -6, -1, 0], [-6, -12, 3, 12], [9, 6, -6, -9], [1, 5, 4, -4], [9, -4, -4, 9], [-1, -1, -2, 3], [-7, -5, 12, 12], [-8, 16, 0, -8], [3, -10, -3, 20], [3, 0, 3, 0], [5, 5, -12, 7], [-3, 2, 2, -3], [5, 4, -4, -5], [-3, 2, -3, 0], [0, 2, 15, 2], [-13, 13, 2, -11], [0, -4, -7, -4], [4, 0, -8, -16], [15, 0, -15, 0], [-18, -10, 9, 10], [-2, 6, 1, -6], [-5, -8, 5, 16], [0, -4, 1, -4], [0, 2, -5, 2], [-3, 2, -3, 0], [-3, 8, -8, 3], [-7, -16, 16, 7], [-3, -10, -10, -3], [5, 5, 4, -9], [-1, -16, -1, 0], [5, 9, -14, -14], [5, -17, 12, 12], [1, -20, 1, 0], [5, 5, -10, -10], [-5, -5, -2, 7], [-11, -4, -4, -11], [13, 17, 4, -4], [-13, 2, -13, 0], [4, 0, 0, 0], [-2, 0, 4, 0], [-11, 4, 4, -11], [-4, 0, 8, 12], [-19, 19, 14, -5], [5, 8, 8, 5], [-9, 9, 8, -1], [13, 1, -12, 12], [0, 2, 7, 2], [-11, -6, 6, 11], [5, 9, 4, -4], [-9, -9, -6, 15], [-3, -3, 6, 6], [29, -2, -29, 4], [22, -8, 0, 4], [-1, -6, 1, 12], [9, -5, -4, -4], [-11, -11, 4, 7], [42, 0, -21, 0], [1, 16, -16, -1], [-11, -13, -2, 2], [-17, 17, 22, 5], [0, 4, -7, 4], [9, -18, -18, 9], [9, -9, 8, 17], [-18, 2, 9, -2], [21, -21, -4, 17], [-6, 0, 12, -32], [-3, -10, -10, -3], [9, -1, -10, 10], [9, -14, 9, 0], [-6, 12, 3, -12], [-23, 2, 2, -23], [11, 11, -16, 5], [1, 19, -20, -20], [6, -16, 0, 8], [-11, 7, 4, 4], [-11, 24, 24, -11], [5, -14, 14, -5], [0, -6, -5, -6], [-5, 5, -12, -17], [0, -20, -3, -20], [6, 0, -12, 32], [12, 0, -24, 0], [-34, -18, 17, 18], [4, 0, -8, -24], [14, 0, -28, -12], [0, 8, 1, 8], [-21, 21, 4, -17], [0, -2, -21, -2], [-9, -2, -9, 0], [-11, -10, 10, 11], [25, 25, -10, -15], [13, -16, 13, 0], [5, 18, -5, -36], [5, -5, 0, 0], [-3, -31, 34, 34], [19, 8, 19, 0], [5, -9, 4, 4], [9, 23, 14, -14], [-15, -36, 36, 15], [5, 6, 5, 0], [-7, -25, -18, 18], [4, 0, -8, 28], [17, -17, 4, 21], [35, 4, -35, -8], [9, 18, 18, 9], [6, 24, 0, -12], [13, 23, 10, -10], [0, -10, -5, -10], [42, -16, -21, 16], [17, 7, -10, 10], [5, 5, -20, 15], [-19, 11, 8, 8], [-37, 10, 37, -20], [-19, -14, 19, 28], [15, 15, -14, -1], [-14, 24, 7, -24], [-15, -22, 22, 15], [-3, -19, -16, 16], [3, -3, 12, 15], [-12, -16, 0, 8], [0, -8, 5, -8], [9, -9, -18, -9], [8, 0, -16, -40], [-19, 28, 28, -19], [-6, 0, 12, -8], [-16, 16, 0, -8], [-9, -22, -9, 0], [2, 4, -1, -4], [-3, 6, -6, 3], [-3, 1, 4, -4], [41, -25, -16, -16], [-16, 48, 0, -24], [-1, 40, -1, 0], [-15, -15, 12, 3], [-3, 16, -16, 3], [1, 16, -16, -1], [0, -14, 19, -14], [27, -27, -14, 13], [6, 0, -12, -48], [15, 12, -15, -24], [-18, -2, 9, 2], [6, 0, -12, 12], [0, -20, -7, -20], [-9, 9, -2, -11]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_260_bf_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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