
// Make newform 2268.2.bm.b in Magma, downloaded from the LMFDB on 12 September 2025.
// To make the character of type GrpDrchElt, type "MakeCharacter_2268_bm();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_2268_bm_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_2268_2_bm_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_2268_2_bm_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, -1, 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_2268_bm();"
function MakeCharacter_2268_bm()
    N := 2268;
    order := 6;
    char_gens := [1135, 1541, 325];
    v := [6, 1, 5];
    // 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_2268_bm_Hecke();"
function MakeCharacter_2268_bm_Hecke( : Kf := false)
    N := 2268;
    order := 6;
    char_gens := [1135, 1541, 325];
    char_values := [[1, 0], [1, -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, 0], [0, 0], [0, 0], [-2, -1], [0, 0], [1, 1], [0, 0], [4, -2], [0, 0], [0, 0], [2, -1], [0, -1], [0, 0], [0, -13], [0, 0], [0, 0], [0, 0], [-9, -9], [0, -11], [0, 0], [-8, -8], [13, -13], [0, 0], [0, 0], [-6, 3], [0, 0], [11, -22], [0, 0], [-19, 19], [0, 0], [-1, 0], [0, 0], [0, 0], [-13, -13], [0, 0], [19, 0], [24, -12], [0, 25], [0, 0], [0, 0], [0, 0], [-4, 8], [0, 0], [0, -25], [0, 0], [-15, -15], [-13, 13], [12, -6], [0, 0], [5, -10], [0, 0], [0, 0], [-15, 30], [0, 0], [0, 0], [0, 0], [0, 0], [18, -9], [5, 0], [0, 0], [-26, 13], [0, 0], [17, -34], [0, 0], [-16, -16], [0, 0], [32, -32], [-34, 34], [0, 0], [-6, 3], [0, 0], [0, 0], [-22, 44], [38, 0], [37, 0], [0, 0], [0, 0], [46, -23], [0, 0], [-46, 23], [0, 0], [0, 22], [0, 0], [-11, 22], [18, 18], [0, 0], [0, 0], [-31, 31], [0, 0], [-20, 20], [0, 0], [0, 0], [44, -44], [0, 0], [-11, 0], [0, 0], [0, 0], [0, 0], [34, -17], [0, 46], [0, 1], [0, 0], [0, 0], [0, 0], [0, 16], [-19, -19], [0, 0], [0, 0], [0, 0], [50, -25], [26, -52], [-47, 47], [0, 0], [-5, 10], [-43, 0], [0, 0], [-11, -11], [0, 0], [0, 0], [0, 0], [-40, 20], [0, 50], [0, 0], [0, 0], [19, 19], [0, 0], [53, -53], [0, 0], [-62, 31], [19, -38], [37, -37], [0, 0], [52, 0], [-29, 0], [0, 0], [-32, -32], [0, 0], [-54, 27], [0, 0], [0, 0], [-6, 12], [0, 0], [0, -5], [0, 0], [20, 20], [0, 0], [8, -4], [0, 0], [33, -66], [0, 0], [59, 0], [0, 0], [-8, 0], [0, 0], [-59, 0], [0, 0], [0, 53], [0, 0], [29, -58], [0, 0], [0, 0], [0, 0], [61, -61], [0, 0], [0, 0], [0, 0], [17, -17], [13, -26], [-19, 0], [0, 0], [0, 0], [36, 36], [0, 0], [-58, 0], [-74, 37], [0, 0], [0, -41], [0, 0], [3, -6], [-37, -37], [4, -4], [0, 0], [43, -43], [0, 0], [0, 0], [0, 0], [65, -65], [34, -68], [29, 0], [0, 0], [32, -16], [0, 0], [0, 11], [0, 0], [0, 0], [0, 0], [0, 2], [-17, 17], [0, 0], [0, 0], [0, 0], [-58, 29], [33, -66], [27, -54], [0, 0], [0, 0], [-66, 33], [0, 0], [0, 0], [30, -15], [0, -71], [0, 0], [0, -55], [0, 0], [0, 0], [-31, -31], [0, -4], [0, 0], [0, 0], [0, 0], [43, 0], [-25, -25], [0, 0], [0, 20], [0, 0], [0, 71], [0, 0], [0, 0], [-2, -2], [0, 0], [0, 2], [30, 30], [29, -29], [0, 0], [-2, 1], [0, 0], [40, -80], [0, 0], [0, 0], [0, 0], [0, 0], [-52, 26], [-68, 34], [0, 11], [0, 0], [0, 0], [-41, 82], [0, 0], [0, -32], [0, 0], [29, -29], [0, 0], [0, 0], [26, -13], [0, 0], [0, 0], [-53, 53], [-43, 86], [0, 0], [48, -24], [68, 0], [0, 0], [94, -47], [43, -86], [0, 0], [47, 47], [0, 0], [0, 0], [40, -40], [0, 0], [-44, 88], [-61, 61], [-29, 58], [-83, 0], [-48, -48], [18, -9], [0, 0], [-23, 0], [0, -73], [0, 0], [0, 0], [0, 79], [0, 0], [82, -41], [-9, 18], [0, 0], [17, -17], [0, 0], [23, -46], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0], [0, 85], [0, 0], [25, 25], [0, 0], [0, 0], [-86, 43], [-51, 102], [0, 0], [52, -52]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_2268_bm_Hecke( : Kf := Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_2268_2_bm_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_2268_2_bm_b(:prec:=2)
    chi := MakeCharacter_2268_bm();
    f_vec := qexpCoeffs();
    Kf := Universe(f_vec);
    // SetVerbose("ModularForms", true);
    // SetVerbose("ModularSymbols", true);
    S := CuspidalSubspace(ModularForms(chi, 2));
    S := BaseChange(S, Kf);
    maxprec := NextPrime(1999) - 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_2268_2_bm_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_2268_2_bm_b( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_2268_bm();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<5,R![0, 1]>,<13,R![3, -3, 1]>],Snew);
    return Vf;
end function;