TensorInduced:

 - assume: low index already ran
   if the action on one tensor factor has a small degree permrep, then
   low index might have found r* this one.

 - Look at dimension to guess r
 - Let l := LCM(Exponents of primitive groups on r points)
 - Create random elements in G, power up with l
 - Take Fast Normal closure
 - check reducibility, clifford gives permrep or tensor
 - otherwise hope that this is tensor decomposable and our method is
   applicable
 - check whether tensor decomp is respected by the entire group.


Lie:

A,l,q   ->   Darstellungen SL(l+1,q) = proj. Darstellungen PSL(l+1,q)
B,l,q   ->   Spin(2l+1,q)      PSpin , Omega in SO(2l+1,q)
C,l,q   ->   Sp(2l,q)                  PSp(2l,q)
D,l,q   ->   Spin(2l,q)
E,6-8,
F,4
G,2
2A,l,q  ->   SU(l+1,q)
2D,l,q  ->   Spin^-(2l,q)
3D,4,q
2E,6,q
2B,2,q=2^*   (* ist ungerade)
2F,2,q=2^*   (* ist ungerade)
2G,2,q=3^*   (* ist ungerade)



Change framework to sort hints into database according to rank???
