ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix an nn-cycle ss and map every nn-cycle qq to its conjugate D(q)=qsq−1D(q) = q s q^{-1}, which is the same as reading the one-line word (q(0),…,q(n−1))(q(0), \ldots, q(n-1)) back as a cycle. Iterating DD turns the (n−1)!(n-1)! nn-cycles into a functional graph. Its only fixed point is ss, and the cycles that eventually reach ss form a tree feeding into it. How deep is that tree?

Exactly φ(n)\varphi(n) cycles map directly onto ss, and the tree stays shallow - depth 1 - unless 8∣n8 \mid n or p2∣np^2 \mid n for an odd prime pp, which is the Hull-Dobell threshold for the existence of a full-period non-translation affine map on Z/n\mathbb{Z}/n. Past it the depth is pe−1p^{e-1} for n=pen = p^e with pp odd, 2e−1−12^{e-1} - 1 for n=2en = 2^e, and for general nn the largest of these over the prime powers dividing nn.

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.