All Questions

Suppose that for a permutation puzzle on $n$ elements we have a subroutine to place any $m>3$ elements in arbitrary positions (possibly scrambling the rest). Can we solve the puzzle (if it is ...

Let $G$ be a finitely generated group. I am trying to count the number of permutation representations on $n$ elements, i.e. homomorphisms from $G$ to the symmetric group $S_n$. Equivalently this is ...