All Questions

Given a finite permutation group, i.e. a subgroup of the symmetric group on $n$ symbols in terms of generators, what is the complexity of the word problem? That is, computing if two words in the ...

Given a finite permutation group $G$ (a subgroup of the symmetric group on a finite set) in terms of its generators, what is known about the decision problem of deciding if $G$ is $k$-transitive for a ...

I want to consider the following problem, which generalises the decision problem to decide if a given finite permutation group is a Frobenius group: Given a finite permutation group in terms of its ...