SearcharxivSearch

arXiv · 1109.2256

Power map permutations and symmetric differences in finite groups

Abstract

Let $G$ be a finite group. For all $a \in \Z$, such that $(a,|G|)=1$, the function $ρ_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 $ρ_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}(ρ_a)=(\frac{d_G}{a})$ for all $G$ in a large class of groups, containing all finite nilpotent and odd order groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Márton Hablicsek, Guillermo Mantilla-Soler. 2011-09-10. Power map permutations and symmetric differences in finite groups. https://doi.org/10.1142/s0219498811005051

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR