
TL;DR
This paper extends the analysis of cycle structures in power maps from finite fields to various finite groups, providing estimates and identifying minimal cycle counts in certain classes.
Contribution
It generalizes previous results to cyclic, symmetric, dihedral, and special linear groups, and identifies minimal cycle counts in nilpotent groups of fixed order and exponent.
Findings
Cycle estimates for multiple finite groups
Cyclic groups minimize cycles among nilpotent groups of fixed order
New problems posed for future research
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Limits and Structures in Graph Theory · Geometric and Algebraic Topology
