Modified print statements

Author: MaximusMellberg

src/FinalReduction.jl

@@ -34,7 +34,7 @@ function computeT(f, Basis, M, termorder, vars_reversed)
     if vars_reversed == true
         partials = reverse(partials)
     end
-    println(partials)
+    #println(partials)
 
     T = zero_matrix(precisionring, 0, len)
 
@@ -79,7 +79,7 @@ function computeT(f, Basis, M, termorder, vars_reversed)
                 #T = vcat(matrix(precisionring,1,len,tmp),T)
                 T = vcat(tmp, T)
             else 
-                println(monomials)
+                #println(monomials)
                 tmp = zero_matrix(precisionring, len_basis, len)
                 for j in 1:len # indexing over monomials
                     for k in 1:length(basis)

src/FindMonomialBasis.jl

@@ -133,6 +133,9 @@ function compute_monomial_basis(f, m, R, PR, termorder)
 
     rows = size(M)[1]
 
+    temp = size(M)
+    println("Matrix of size $temp")
+
     pivot_rows = pivot_columns(transpose(M))
     non_pivot_rows = setdiff([1:rows;], pivot_rows)
     return map((i) -> row_monomials[i], non_pivot_rows)
@@ -175,6 +178,9 @@ function pseudo_inverse_controlled(f, S, l, R, PR, termorder,vars_reversed)
     fLift = liftCoefficients(ZZ,PRZZ,f)
 
     U = compute_controlled_matrix(fLift, l, S, ZZ, PRZZ, termorder,vars_reversed)
+
+    temp = size(U)
+    println("Matrix of size $temp")
 
     flag, B = is_invertible_with_inverse(matrix(R,[R(x) for x in Array(U)]), side=:right)
 

src/StandardReduction.jl

@@ -21,7 +21,7 @@ INPUTS:
 * "termorder" -- the monomial ordering of vectors
 """
 function monomial_change_basis(f, l, basis, termorder, vars_reversed)
-       println(basis)
+       #println(basis)
        p = characteristic(parent(f))
        n = nvars(parent(f)) - 1
        S = [i for i in 0:n]
@@ -47,7 +47,7 @@ function monomial_change_basis(f, l, basis, termorder, vars_reversed)
 
        #change_basis_matrix_aug = hcat(change_basis_matrix,basis_columns); 
        change_basis_matrix_aug = hcat(basis_columns,change_basis_matrix); 
-       println((rank(change_basis_matrix_aug), number_of_columns(change_basis_matrix_aug), number_of_rows(change_basis_matrix_aug)))
+       #println((rank(change_basis_matrix_aug), number_of_columns(change_basis_matrix_aug), number_of_rows(change_basis_matrix_aug)))
        return change_basis_matrix_aug
 end 
 

src/ZetaFunction.jl

@@ -34,7 +34,6 @@ INPUTS:
 """
 function compute_frobenius_matrix(n, p, d, N_m, Reductions, T, Basis, termorder, verbose)
     verbose && println("Terms after controlled reduction: $Reductions")
-    println(T)
     R = parent(T[1,1])
     frob_mat_temp = []
     denomArray = []
@@ -244,7 +243,6 @@ function zeta_function(f; verbose=false, givefrobmat=false, algorithm=:costachun
     #end
     #TODO: check which algorithm we're using
     Reductions = reducetransform(FBasis, N_m, S, fLift, pseudo_inverse_mat, p, termorder,algorithm,vars_reversed,fastevaluation,verbose=verbose)
-    println(Reductions)
     if verbose
         for i in 1:length(Basis)
             basis_elt = Basis[i]
@@ -255,6 +253,7 @@ function zeta_function(f; verbose=false, givefrobmat=false, algorithm=:costachun
     ev = gen_exp_vec(n+1,n*d-n-1,termorder)
     verbose && println(convert_p_to_m([Reductions[1][1][1],Reductions[2][1][1]],ev))
     FM = compute_frobenius_matrix(n, p, d, N_m, Reductions, T, Basis, termorder, verbose)
+    display(FM)
     verbose && println("The Frobenius matrix is $FM")
 
     #reductions_verbose = convert_p_to_m([Reductions[1][1][1],Reductions[2][1][1]],ev)
@@ -330,12 +329,11 @@ include("Frobenius.jl")
 include("FinalReduction.jl")
 include("ZetaFunction.jl")
 verbose = false
-n = 2
-d = 3
-p = 7
+n = 5
+p = 13
 F = GF(p)
-R, (x,y,z) = polynomial_ring(F, ["x$i" for i in 0:n])
+R, (x1,x2,x3,x4,x5,x6) = polynomial_ring(F, ["x$i" for i in 0:n])
 
-f = y^2*z - x^3 - x*z^2 - z^3
+f = x1^3 + x2^3 + x3^3 + x4^3 + x5^3 + x6^3
 @time DeRham.zeta_function(f)
 =#