Power map permutations and symmetric differences in finite groups

Details Power map permutations and symmetric differences in finite groups Power map permutations and symmetric differences in finite groups

2011-09-10

arxiv.org/abs/1109.2256v1

Mathematics

Group Theory

Electronic version of an article to be published as, Journal of Algebra and its Applications, 2011, DOI No: 10.1142/S021949881

Scientific paper

10.1142/S0219498811005051

Let $G$ be a finite group. For all $a \in \Z$, such that $(a,|G|)=1$, the function $\rho_a: G \to G$ sending $g$ to $g^a$ 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 $\rho_a$. By introducing the group of conjugacy equivariant maps and the symmetric difference method on groups, we exhibit an integer $d_{G}$ such that $\text{sgn}(\rho_a)=(\frac{d_G}{a})$ for all $G$ in a large class of groups, containing all finite nilpotent and odd order groups.

Affiliated with

Also associated with

No associations

Rating

Power map permutations and symmetric differences in finite groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Power map permutations and symmetric differences in finite groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Power map permutations and symmetric differences in finite groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-38788