Depth of the in-tree of s under q ↦ q s q^-1 on n-cycles
Statement
Fix an -cycle and map every -cycle to its conjugate , which is the same as reading the one-line word back as a cycle. Iterating turns the -cycles into a functional graph. Its only fixed point is , and the cycles that eventually reach form a tree feeding into it. How deep is that tree?
Exactly cycles map directly onto , and the tree stays shallow - depth 1 - unless or for an odd prime , which is the Hull-Dobell threshold for the existence of a full-period non-translation affine map on . Past it the depth is for with odd, for , and for general the largest of these over the prime powers dividing .
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.