Gaussian cycle-count conjecture for permutations with averaged cycle weights
Statement
Let be a sequence of nonnegative real numbers with mean , meaning that
Permutations of selected according to the weights should have an asymptotically Gaussian number of cycles as , with mean and variance asymptotic to . This conjecture predicts that the average of the cycle weights controls the limiting cycle-count behaviour, extending analogous results for Boltzmannized permutations; the stated context gives supporting evidence but does not establish the conjecture for the general sequences covered here.
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.