Power maps in finite groups
Combinatorics
2019-07-09 v4 Group Theory
Number Theory
Abstract
In recent work, Pomerance and Shparlinski have obtained results on the number of cycles in the functional graph of the map in . We prove similar results for other families of finite groups. In particular, we obtain estimates for the number of cycles for cyclic groups, symmetric groups, dihedral groups and . We also show that the cyclic group of order minimizes the number of cycles among all nilpotent groups of order for a fixed exponent. Finally, we pose several problems.
Cite
@article{arxiv.1707.06696,
title = {Power maps in finite groups},
author = {Matt Larson},
journal= {arXiv preprint arXiv:1707.06696},
year = {2019}
}
Comments
14 pages, 1 figure