ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SnS_n be the symmetric group, and consider the involution walk whose step distribution depends on a parameter pp. Order the conjugacy classes by cycle lexicographic order. Cycle-lexicographic likelihood-order conjecture. For p≥12p \geq \frac{1}{2}, 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 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.