Let Sn act on (Z2)n in the following way: if g ∈ Sn, w = (w1, ..., wn) ∈ (Z2)n, g . w = (wg(1), ..., wg(n)).
Given a set of pairs of { (w1, g . w1), ..., ( wm, g . wm) }, we may deduce a set of permutations { γ1, ..., γk } such that g = γj for 1 ≤ j ≤k.
Question: Given an arbitrary permutation h ∈ Sn, determine the wi in { (w1, h . w1), ..., ( wm
(
Read more... )