diff --git a/gap/projective/tensor.gi b/gap/projective/tensor.gi
index ee33ac63..aa6ae91a 100644
--- a/gap/projective/tensor.gi
+++ b/gap/projective/tensor.gi
@@ -198,107 +198,6 @@ RECOG.IsKroneckerProduct := function(m,r)
   return [true,a,ac];
 end;
 
-# RECOG.VerifyTensorDecomposition := function(gens,r)
-#   local g,newgens,newgensdec,res,yes;
-#   newgens := List(gens,x->r.t * x * r.ti);
-#   newgensdec := [];
-#   yes := true;
-#   for g in newgens do
-#       res := RECOG.IsKroneckerProduct(g,r);
-#       if res[1] = false then
-#           Add(newgensdec,fail);
-#           yes := false;
-#       else
-#           Add(newgensdec,[res[2],res[3]]);
-#       fi;
-#   od;
-#   return [yes,newgens,newgensdec];
-# end;
-#
-# RECOG.FindInvolution := function(g)
-#   # g a matrix group
-#   local i,o,x;
-#   for i in [1..100] do
-#       x := PseudoRandom(g);
-#       o := Order(x);
-#       if o mod 2 = 0 then
-#           return x^(o/2);
-#       fi;
-#   od;
-#   return fail;
-# end;
-# 
-# RECOG.FindCentralisingElementOfInvolution := function(G,x)
-#   # x an involution in G
-#   local o,r,y,z;
-#   r := PseudoRandom(G);
-#   y := x^r;
-#   # Now x and y generate a dihedral group
-#   if x=y then return r; fi;
-#   z := x*y;
-#   o := Order(z);
-#   if IsEvenInt(o) then
-#       return z^(o/2);
-#   else
-#       return z^((o+1)/2)*r^(-1);
-#   fi;
-# end;
-#
-# RECOG.FindInvolutionCentraliser := function(G,x)
-#   # x an involution in G
-#   local i,l,y;
-#   l := [];
-#   for i in [1..20] do   # find 20 generators of the centraliser
-#       y := RECOG.FindCentralisingElementOfInvolution(G,x);
-#       AddSet(l,y);
-#   od;
-#   return GroupWithGenerators(l);
-# end;
-#
-#
-# RECOG.FindTensorOtherFactor := function(G,N,blocksize)
-#   # N a non-scalar normal subgroup of G
-#   # Basechange already done such that N is a block scalar matrix meaning
-#   # "block-diagonal" and all blocks along the diagonal are equal.
-#   local c,i,invs,o,out,timeout,x,z;
-# 
-#   # Find a non-scalar involution in N:
-#   timeout := 100;
-#   while true do
-#       timeout := timeout - 1;
-#       if timeout = 0 then return fail; fi;
-#       x := RECOG.FindInvolution(N);
-#       if x <> fail and not RECOG.IsScalarMat(x) then
-#           break;
-#       fi;
-#   od;
-# 
-#   invs := [x];
-#   for i in [1..5] do
-#       Add(invs,x^PseudoRandom(N));
-#   od;
-# 
-#   timeout := 100;
-#   while true do
-#       timeout := timeout - 1;
-#       if timeout = 0 then return fail; fi;
-#       c := RECOG.FindCentralisingElementOfInvolution(G,invs[1]);
-#       o := Order(c);
-#       if IsOddInt(o) then continue; fi;
-#       c := c^(o/2);
-#       i := 2;
-#       out := false;
-#       while i <= 5 do
-#           x := invs[i] * c;
-#           o := Order(x);
-#           if IsOddInt(o) then break; fi;
-#           z := x^(o/2);   # this now commutes with invs[1]..invs[i], because
-#                           # it is a power of a product of inv
-#       od;
-#   od;
-# end;
-
-
 #! @BeginChunk TensorDecomposable
 #! This method looks for the tensor-decomposable situation described in
 #! <Cite Key="Neu09" Where="Section VII.(6.6)"/>. It first searches for a