ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite group of order nn, let CnC_n denote the cyclic group of order nn, and let N(a,G)N(a,G) be the number of connected components of the functional graph G(a,G)G(a,G) associated with the power map x↦xax\mapsto x^a. Cyclic-group minimization conjecture. For every aa, one has

N(a,G)≥N(a,Cn).N(a,G)\geq N(a,C_n).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.