加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本