ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let σ⃗=(σ1,σ2,…)\vec{\sigma}=(\sigma_1,\sigma_2,\ldots) be a sequence of nonnegative real numbers with mean α\alpha, meaning that

lim⁡n→∞1n∑k=1nσk=α.\lim_{n\to\infty}\frac{1}{n}\sum_{k=1}^n\sigma_k=\alpha.

Permutations of [n][n] selected according to the weights σ⃗\vec{\sigma} should have an asymptotically Gaussian number of cycles as n→∞n\to\infty, with mean and variance asymptotic to αlog⁡n\alpha\log n. 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 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.