Cycle-lexicographic likelihood-order conjecture for the involution walk
Statement
Let be the symmetric group, and consider the involution walk whose step distribution depends on a parameter . Order the conjugacy classes by cycle lexicographic order. Cycle-lexicographic likelihood-order conjecture. For , the likelihood order for the involution walk is the cycle lexicographic order at all times. This would identify the least likely element and support explicit separation-distance calculations for the walk; the supplied text gives no resolution of the conjecture.
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.