// Make newform 768.3.e.j in Magma, downloaded from the LMFDB on 28 March 2024. // To make the character of type GrpDrchElt, type "MakeCharacter_768_e();" // To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_768_e_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_768_3_e_j();". // 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_768_3_e_j();". // 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 := [9, 0, 0, 0, 1]; Kf := NumberField(Polynomial([elt : elt in poly])); AssignNames(~Kf, ["nu"]); end if; Rf_num := [[1, 0, 0, 0], [0, 0, 1, 0], [0, 12, 0, 4], [0, 12, 0, -4]]; Rf_basisdens := [1, 3, 3, 3]; 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_768_e();" function MakeCharacter_768_e() N := 768; order := 2; char_gens := [511, 517, 257]; v := [2, 2, 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; // To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_768_e_Hecke();" function MakeCharacter_768_e_Hecke(Kf) N := 768; order := 2; char_gens := [511, 517, 257]; char_values := [[1, 0, 0, 0], [1, 0, 0, 0], [-1, 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 := 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 := 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 := 3; raw_aps := [[0, 0, 0, 0], [0, 3, 0, 0], [0, 0, 1, 0], [0, 0, 0, -1], [0, -10, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 3, 0], [0, 0, 0, 5], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 5, 0], [0, 10, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [50, 0, 0, 0], [0, 0, 0, -15], [0, -134, 0, 0], [0, 0, 0, 0], [-190, 0, 0, 0], [0, 0, -7, 0], [0, 0, 0, -21], [0, -86, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, -11], [0, -250, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, -7, 0], [0, 0, 0, -5], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 35, 0], [0, 230, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [-290, 0, 0, 0], [0, 0, -35, 0], [0, 0, 0, 35], [0, 0, 0, 0], [0, 0, 0, -39], [0, 346, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [382, 0, 0, 0], [0, 470, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, -33, 0], [0, 0, 0, -55], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 45, 0], [0, 0, 0, 0], [0, 0, 0, 0], [530, 0, 0, 0], [0, 0, 55, 0], [0, 0, 0, 0], [190, 0, 0, 0], [0, -106, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, -19], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 77, 0], [0, 0, 0, 0], [0, 0, 0, 0], [718, 0, 0, 0], [0, 730, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [-670, 0, 0, 0], [0, 0, 0, -85], [0, 86, 0, 0], [0, 0, 0, 0], [-530, 0, 0, 0], [0, 0, -77, 0], [0, 0, 0, -91], [0, 634, 0, 0], [0, 0, 0, 0], [0, 0, 0, -9], [0, -470, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, -13, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, -65, 0], [0, -326, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [-290, 0, 0, 0], [0, 874, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [-1198, 0, 0, 0], [0, 0, 0, -99], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, -25], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, -85, 0], [0, -730, 0, 0], [0, 0, 0, 0], [-190, 0, 0, 0], [0, 0, -15, 0], [0, 1334, 0, 0], [0, 0, 0, 0], [0, 0, 143, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 11], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, -55], [0, 0, 0, 0], [0, 0, 0, 0], [862, 0, 0, 0], [0, 0, 105, 0], [0, 0, 0, 0], [0, 0, 95, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 153, 0], [0, 0, 0, -161], [0, 1546, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 175], [0, 0, 0, 0], [-1490, 0, 0, 0], [0, 0, 187, 0], [0, -1306, 0, 0], [0, 0, 0, 0], [0, 0, 0, 31], [0, -1930, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 145], [0, 0, 0, 0]]; aps := ConvertToHeckeField(raw_aps); chi := MakeCharacter_768_e_Hecke(Universe(aps)); return ExtendMultiplicatively(weight, aps, chi); end function; // To make the newform (type ModFrm), type "MakeNewformModFrm_768_3_e_j();". // 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_768_3_e_j(:prec:=4) chi := MakeCharacter_768_e(); f_vec := qexpCoeffs(); Kf := Universe(f_vec); // SetVerbose("ModularForms", true); // SetVerbose("ModularSymbols", true); S := CuspidalSubspace(ModularForms(chi, 3)); 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_768_3_e_j();". // 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_768_3_e_j( : sign := -1) R := PolynomialRing(Rationals()); chi := MakeCharacter_768_e(); // SetVerbose("ModularSymbols", true); Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,3,sign))); Vf := Kernel([<5,R![96, 0, 1]>,<7,R![-96, 0, 1]>,<11,R![100, 0, 1]>,<19,R![0, 1]>,<37,R![0, 1]>],Snew); return Vf; end function;