[GAP Forum] complexity of the "orbit" function

[Miguel Marco]

Dear gap forum

I am doing some calculations that involve calculating the orbit of permutation 
groups over sets of sets. The problem is that in some cases, the procedure 
excedes the memory of my computer. I want to detect when will that happen, in 
order to separate the cases where that calculation will take too much memory 
from the rest.
My question is: what does the complexity of the "orbit" function deppend on? 
The order of the group?, the index of the stabilizer of the object? And how 
can i estimate it before attempting to caluclate the actual orbit?


Thanks in advance.


Miguel Angel Marco-Buzunariz
Universidad de Zaragoza