Power map permutations and symmetric differences in finite groups

Abstract

Let G be a finite group. For all a ∈ , such that (a,|G|)=1, the function a: G G sending g to ga defines a permutation of the elements of G. Motivated by a recent generalization of Zolotarev's proof of classic quadratic reciprocity, due to Duke and Hopkins, we study the signature of the permutation a. By introducing the group of conjugacy equivariant maps and the symmetric difference method on groups, we exhibit an integer dG such that sgn(a)=(dGa) for all G in a large class of groups, containing all finite nilpotent and odd order groups.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…