The stabilization-time conjecture for the map \operatorname{SC}_{231}
Statement
Let , let be the set of permutations of , and let denote the permutations avoiding and .
Stabilization-time conjecture. For every ,
Furthermore, there exists such that
The conjecture has been verified for and predicts the sharp number of iterations needed to reach the periodic-point set for this map.
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.