Information sets as permutation cycles for quadratic residue codes.
Intersecting families in the alternating group and direct product of symmetric groups.
Invariance groups of finite functions and orbit equivalence of permutation groups
Which subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question. For k ≤ n, the answer is easy: all subgroups of Sn are invariance groups. We give a complete answer in the cases k = n-1 and k = n-2, and we also give a partial answer in the general case: we describe invariance groups when n is much larger than n-k. The proof utilizes Galois connections...
Invariants of a class of transformation groups.
Inversions of permutations in symmetric, alternating, and dihedral groups.
Involutory Collineations of Finite Planes.