Minor bugfixes. Removed eistenstein_constant from guess in multiple.

Author: mmasdeu

arithgroup.py

@@ -853,6 +853,7 @@ def get_word_rep(self,delta): # rationalmatrix
             ans = shorten_word(self.minus_one_long + ans)
             return self.check_word(delta.matrix(),ans)
         else:
+            assert 0,'delta = %s, err = %s'%(delta, err)
             try:
                 i = gens.index(err)
             except ValueError:

cohomology_arithmetic.py

@@ -587,7 +587,7 @@ def apply_hecke_operator(self,c,l, hecke_reps = None,group = None,scale = 1,use_
         """
         # verbose('Entering apply_hecke_operator')
         if hecke_reps is None:
-            hecke_reps = self.group().get_hecke_reps(l,use_magma = use_magma)
+            hecke_reps = self.group().get_hecke_reps(l,use_magma = use_magma, g0 = g0)
         # verbose('Got hecke reps')
         V = self.coefficient_module()
         padic = not V.base_ring().is_exact()

config.ini

@@ -1,6 +1,6 @@
 [General]
 # Default (None) means that the code will create a name from the input data
-outfile : None
+outfile : 'log'
 
 # Default (None) means to use the distributions in Pollack-Stevens's code only if needed.
 use_ps_dists: None

darmonpoints.sage

@@ -200,8 +200,8 @@ def darmon_point(P, E, beta, prec, ramification_at_infinity = None, input_data =
                         magma.quit()
                     return G
             eisenstein_constant = -ZZ(E.reduction(ell).count_points())
-            fwrite('r = %s, so a_r(E) - r - 1 = %s'%(ell,eisenstein_constant),outfile)
-            fwrite('exponent = %s'%nn,outfile)
+            fwrite('r = %s, so a_r(E) - r - 1 = %s'%(ell,eisenstein_constant), outfile)
+            fwrite('exponent = %s'%nn, outfile)
             phiE = Coh.get_cocycle_from_elliptic_curve(E, sign = sign_at_infinity)
             if hasattr(E,'ap'):
                 sign_ap = E.ap(P)
@@ -285,7 +285,7 @@ def darmon_point(P, E, beta, prec, ramification_at_infinity = None, input_data =
         local_embedding = Qp(p,working_prec)
         twopowlist = [4, 3, 2, 1, 1/2, 3/2, 1/3, 2/3, 1/4, 3/4, 5/2, 4/3]
 
-    known_multiple = eisenstein_constant * nn
+    known_multiple = nn # * eisenstein_constant # It seems that we are not getting it with present algorithm.
     while known_multiple % p == 0:
         known_multiple = ZZ(known_multiple / p)
 

sarithgroup.py

@@ -384,6 +384,7 @@ def subdivide(self,edgelist,parity,depth):
     def wp(self):
         verbose('Finding a suitable wp...')
         if self.F == QQ and self.discriminant == 1:
+            epsinv = matrix(QQ,2,2,[0,-1,self.p,0])**-1
             if self.level == 1:
                 try:
                     ans = matrix(QQ,2,2,[0,-1,self.ideal_p.gens_reduced()[0],0])
@@ -395,7 +396,6 @@ def wp(self):
                 p = self.ideal_p
                 m = self.level
                 g,w,z = XGCD(p,-m)
-                epsinv = matrix(QQ,2,2,[0,-1,self.p,0])**-1
                 ans = matrix(QQ,2,2,[p,1,p*m*z,p*w])
                 i = 0
                 all_initial = []