Power map permutations and symmetric differences in finite groups

preprint2011arXivOpen access

Abstract

Let GG be a finite group. For all a∈Za \in \Z, such that (a,∣G∣)=1(a,|G|)=1, the function ρa:G→Gρ_a: G \to G sending gg to gag^a defines a permutation of the elements of GG. 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ρ_a. By introducing the group of conjugacy equivariant maps and the symmetric difference method on groups, we exhibit an integer dGd_{G} such that sgn(ρa)=(dGa)\text{sgn}(ρ_a)=(\frac{d_G}{a}) for all GG in a large class of groups, containing all finite nilpotent and odd order groups.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.