Conjecture on the longest increasing subsequence of conjugation-invariant permutations
Statement
Let be a sequence of conjugation-invariant random permutations, where has size and random cycle type . Suppose that
in probability. Conjecture on the longest increasing subsequence. Then
in probability. The result would identify the same first-order asymptotic as for uniform permutations when the number of fixed points is negligible compared with ; related cases are known for random involutions and under additional cycle constraints.
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.