passagemath-pari 10.6.32__cp314-cp314-musllinux_1_2_x86_64.whl

sage/ext_data/pari/buzzard/Tpprog.g

@@ -0,0 +1,179 @@
+\\ Tpprog.g, V2.2---a program to compute conjectural slopes.
+\\ By Kevin Buzzard (buzzard@ic.ac.uk)
+\\ Please report any problems to buzzard@ic.ac.uk
+\\
+\\ Version history:
+\\
+\\ V2.2, 10/8/01, minor tinkering.
+\\
+\\ Version 2.1, 9/8/01. Complete rewrite motivated by desire to publish
+\\ a paper.
+\\
+\\ Version history:
+\\
+\\ Version 1.2, 7/8/00 minor edit for p=2 because I guess
+\\ that kmin should be 6 not 4, judging by N=5 case; also I
+\\ redefined "ordinary" for p=2 by saying "as many 0s as possible
+\\ in wt 4 and then the rest 1s".
+
+\\ Version 1.1, 26/7/00 (post France, just found it in the mess.)
+\\                      I don't yet know what it does but we live in hope!
+\\
+\\ Uses: function c0() from genusn.g
+\\       function DimensionCuspForms() from DimensionSk.g
+
+
+print();
+print("tpslopes(p,N,kmax) returns a vector of length kmax, whose k'th entry");
+print("(1<=k<=kmax) is the conjectural sequence of valuations of eigenvalues");
+print("of T_p on forms of level N, weight k, and trivial character.");
+print("The conjecture is only valid if p doesn't divide N and if p is");
+print("Gamma_0(N)-regular.");
+print()
+print("Example of use:");
+print("(12:48) gp > c=tpslopes(2,1,100);");
+print("(12:48) gp > c[100]");
+print("%2 = [3, 9, 9, 17, 17, 26, 26, 32]");
+print()
+print("Hence I conjecture that the 2-adic valuations of the eigenvalues of");
+print("T_2 on cusp forms of level 1 and weight 100 are [3,9,9,...,32],");
+print("which indeed they are, as one can verify by an explicit computation.");
+
+
+tpslopes(p,N,kmax)=
+{
+  local(t,s,kmin,a,b,c,alg,k1,k2,k3,v1,v2,v3,B,e,S,s2,
+        e2,epsilon,V1,V,V1tmp,w,w0,kmaxtemp);
+
+  kmaxtemp=if(p==2,5,p+2);
+  if(kmax>kmaxtemp,kmaxtemp=kmax);
+
+  t=vector(kmaxtemp,i,[]);
+
+  \\ initialise t vector in regular case.
+
+  t[2]=vector(S0(N*p,2)-S0(N,2),i,0);
+  if(p==2,
+    t[4]=concat(t[2],vector(S0(N,4)-length(t[2]),i,1));
+    kmin=6
+  ,
+    forstep(k=4,p+1,2,
+      t[k]=vector(S0(N,k),i,0)
+    );
+    kmin=p+3
+  );
+
+  s=t;
+  s[2]=vector(S0(N,2),i,0);
+
+  \\ Are we done yet?
+  if(kmax<kmin,
+    vector(kmax,i,s[i])
+  ,
+    \\ no we're not!
+
+    m=c0(N); \\ for non-trivial (even) character at *N*, I seem to have once
+             \\ thought that the analogue should be dim(mod forms wt 4)
+             \\ minus dim(cusp forms wt 4).
+
+    forstep(k=kmin,kmax,2,
+
+      a=1;while(p^a<k-1,a++);a=a-1;
+
+      b=1;while(p^a*b<k-1,b++);b=b-1;
+
+      c=1+floor((k-2-p^a*b)/(p^(a-1)));
+
+      if(b+c<=p-1,alg=1,
+        if(b<p-1,alg=2,
+          alg=3
+        )
+      );
+
+      if(alg==1,
+        k1=k-b*(p-1)*p^(a-1);
+        k2=k-(b-1)*(p-1)*p^(a-1)-2*(b+c-1)*p^(a-1);
+        v1=t[k1];
+        v2=t[k2];
+        B=p^a*b+p^(a-1)*(c-1)+1;
+        e=k-B;
+        epsilon=DirichletCharacter(p,[(B-1)%(p-1)]);
+        S=1+DimensionCuspForms(charmult(epsilon,TrivialCharacter(N)),1+e);
+
+        if(length(v1)>=S-1,
+          V1=vector(S-1,i,v1[i])
+        ,
+          V1=concat(v1,vector(S-1-length(v1),i,e-v2[S-length(v1)-i]))
+        );
+
+        V=concat(V1,vector(m,i,e));
+      ,
+        if(alg==2,
+          k1=k-(b+1)*p^(a-1)*(p-1);
+          k2=k-p^(a-1)*(p-1);
+          v1=t[k1];
+          v2=t[k2];
+          B=(b+1)*p^(a-1)*(p-1)+1;
+          e=k-B;
+          S=1+S0(N*p,1+e);
+          s2=(S-1)\2;
+          e2=e\2;
+
+          if(length(v1)>=S-1,
+            V1=vector(S-1,i,v1[i])
+          ,
+            if(S-1<=2*length(v1),
+              V1=concat(v1,vector(S-1-length(v1),i,e-v1[S-length(v1)-i]))
+            ,
+              w=vector(s2-length(v1),i,v2[length(v1)+i]);
+              V1=concat(v1,w);
+              if(S%2==0,V1=concat(V1,[e2]));
+              V1=concat(V1,vector(length(w),i,e-1-w[length(w)+1-i]));
+              V1=concat(V1,vector(length(v1),i,e-v1[length(v1)+1-i]));
+
+            )
+          );
+          V=concat(V1,vector(m-(e==1),i,e));
+        ,
+          \\ alg=3.
+          k1=k-p^a*(p-1);
+          k2=k-p^(a-1)*(p-1);
+          v1=t[k1];
+          v2=t[k2];
+          B=p^a*(p-1)+1;
+          e=k-B;
+          S=1+S0(N*p,1+e);
+          s2=(S-1)\2;
+          e2=e\2;
+          if(length(v1)>=S-1,
+            V1=vector(S-1,i,v1[i])
+          ,
+            if(S-1<=2*length(v1),
+              V1=concat(v1,vector(S-1-length(v1),i,e-v1[S-length(v1)-i]))
+            ,
+              \\ case I don't understand :-*
+              w0=vector(s2-length(v1),i,v2[length(v1)+i]);
+              w=vector(s2-length(v1),i,if(w0[i]<e2,w0[i]+1,e2));
+              V1=concat(v1,w);
+              if(S%2==0,V1=concat(V1,[e2]));
+              V1=concat(V1,vector(length(w),i,e-1-w[length(w)+1-i]));
+              V1=concat(V1,vector(length(v1),i,e-v1[length(v1)+1-i]));
+            )
+          );
+        V=concat(V1,vector(m-(e==1),i,e));
+        )
+      );
+      if(length(V)>=S0(N,k),
+        t[k]=vector(S0(N,k),i,V[i])
+      ,
+        k3=2*B-k;
+        v3=t[k3];
+        t[k]=concat(V,vector(S0(N,k)-length(V),i,e+v3[i]))
+      );
+
+      s[k]=t[k];
+
+    );
+  s
+  )
+}

sage/ext_data/pari/buzzard/genusn.g

@@ -0,0 +1,129 @@
+\\ genusn.g, V1.3, by Bruce Kaskel, tinkered with by Kevin Buzzard.
+\\
+\\ Please report any problems to Kevin Buzzard (buzzard@ic.ac.uk)
+\\
+\\ These are Bruce Kaskel's programs for computing various things like
+\\ dimensions of S_k(Gamma_0(N)) and so on.
+\\
+\\ Version history:
+\\
+\\ V1.3, 10/8/2001. Changed the syntax of local variables to
+\\ correspond with current pari-2 philosophy.
+\\
+\\ V1.2: a minor correction by KMB, unfortunately I forgot what it was. I
+\\ think it was to do with a "\" sign being interpreted at slightly the
+\\ wrong time.
+\\
+\\ V1.1: original, by Bruce Kaskel.
+
+mu0(n)=local(m,npd);m=factor(n);npd=matsize(m)[1];prod(x=1,npd,1+1/m[x,1],n);
+mu20(n)=
+{
+  local(m,npd);
+  if(n%4==0,0,m=factor(n);npd=matsize(m)[1];
+    prod(x=1,npd,1+kronecker(-4,m[x,1]),1));
+}
+mu30(n)=
+{
+  local(m,npd);
+  if(n%2==0 || n%9==0,0,
+   m=factor(n);npd=matsize(m)[1];prod(x=1,npd,1+kronecker(-3,m[x,1]),1));
+}
+c0(n)=sumdiv(n,x,eulerphi(gcd(x,n/x)));
+g0(n)=1+mu0(n)/12-mu20(n)/4-mu30(n)/3-c0(n)/2;
+\\
+mu1(n)=if(n<=2,mu0(n),eulerphi(n)*mu0(n)/2);
+mu21(n)=if(n<4,mu20(n),0);
+mu31(n)=if(n<4,mu30(n),0);
+c1(n)=if(n<=3,c0(n),if(n==4,3,sumdiv(n,x,eulerphi(x)*eulerphi(n/x))/2));
+g1(n)=1+mu1(n)/12-mu21(n)/4-mu31(n)/3-c1(n)/2;
+\\
+ss0(n,p)=
+{
+  if(isprime(p)==0 || n%p==0,
+   print("Function format: ss0(N,p) where p is prime and doesn't divide N.")
+  ,g0(n*p)-2*g0(n)+1);
+}
+\\
+muXNp(n,p)=mu1(n)*mu0(p);
+mu2XNp(n,p)=0;
+mu3XNp(n,p)=0;
+cXNp(n,p)=2*c1(n);
+gXNp(n,p)=
+if(n<4,g0(N*p),1+muXNp(n,p)/12-mu2XNp(n,p)/4-mu3XNp(n,p)/3-cXNp(n,p)/2);
+ss1(n,p)=
+{
+  if(isprime(p)==0 || n%p==0,
+   print("Function format: ss1(N,p) where p is prime and doesn't divide N.")
+  ,gXNp(n,p)-2*g1(n)+1);
+}
+\\
+eisen(p)=
+{
+  if(isprime(p)==0,print("Function format: eisen(N) where N is prime.")
+  ,numer((p-1)/12));
+}
+\\
+S0(n,k)=
+{
+  if(n<1,print("S0(N,k), N must be a positive integer")
+  ,if(k<=0 || k%2,0,
+  if(k==2,g0(n),(k-1)*(g0(n)-1)+(k/2-1)*c0(n)+mu20(n)*(k\4)+mu30(n)*(k\3))));
+}
+\\
+M0(n,k)=
+{
+  if(n<1,print("M0(N,k), N must be a positive integer")
+  ,if(k<=0 || k%2,0,S0(n,k)+c0(n)-(k==2)));
+}
+S1(n,k)=
+{
+  if(n<1,print("S1(N,k), N must be a positive integer")
+  ,if(k<=0 || (n<3 && k%2),0,
+  if(k==1,print("S1(N,k), k=1 not programmed for N>2.")
+  ,if(k==2,g1(n)
+  ,if(n<3,S0(n,k)
+  ,(k-1)*(g1(n)-1)+(k/2-1)*c1(n)+(n==4 && k%2)/2+(n==3)*k\3)))));
+}
+M1(n,k)=
+{
+  if(n<1,print("M1(N,k), N must be a positive integer")
+  ,if(k<=1,print("M1(N,k), k must be >=2"),S1(n,k)+c1(k)-(k==2)))
+}
+\\  coefficients of zeta(s)^-2
+mumu(n,x,k,p)=
+{
+  if(type(n)!="t_INT" || n<1,print("mumu(N): N must be a positive integer.")
+  ,x=factor(n);k=matsize(x)[1];p=1;
+  for(y=1,k,if(x[y,2]>2,p=0,if(x[y,2]==1,p=-2*p,)));p);
+}
+\\
+nf0(n,k)=
+{
+  if(n<1 || type(n)!="t_INT",print("nf0(N,k): N must be a positive integer.")
+  ,if(type(k)!="t_INT",print("nf0(N,k): k must be an integer.")
+  ,sumdiv(n,x,S0(x,k)*mumu(n/x))));
+}
+\\
+nf1(n,k)=
+{
+  if(n<1 || type(n)!="t_INT",print("nf1(N,k): N must be a positive integer.")
+  ,if(type(k)!="t_INT",print("nf1(N,k): k must be an integer.")
+  ,sumdiv(n,x,S1(x,k)*mumu(n/x))));
+}
+\\
+print("c0(N) -- calculates the number of cusps on X_0(N).");
+print("g0(N) -- calculates the genus of X_0(N).");
+print("ss0(N,p) -- calculates the number of s.s. points at p of X_0(N).");
+print("S0(N,k) -- calculates the dim of the wt. k cusp forms on Gamma_0(N).");
+print("nf0(N,k) -- calculates the dim of the wt. k newforms on Gamma_0(N).");
+print("eisen(N) -- (N PRIME!) calcs. the order of (0)-(\infty) on J_0(N).");
+print("c1(N) -- calculates the number of cusps on X_1(N).");
+print("g1(N) -- calculates the genus of X_1(N).");
+print("ss1(N,p) -- calculates the number of s.s. points at p of X_1(N).");
+print("S1(N,k) -- calculates the dim of the wt. k cusp forms on Gamma_1(N).");
+print("nf1(N,k) -- calculates the dim of the wt. k newforms on Gamma_1(N).");
+print("Please notify me (buzzard@ic.ac.uk) if any of these functions seem");
+print("to be giving erroneous answers.");
+print("Original version by Bruce Kaskel.");
+