Cyclic groups minimize the number of connected components of power maps
Statement
Let be a finite group of order , let denote the cyclic group of order , and let be the number of connected components of the functional graph associated with the power map . Cyclic-group minimization conjecture. For every , one has
The conjecture asserts that cyclic groups have the fewest connected components among groups of a given order. The source gives no further evidence for its resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.