ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r>2r>2 and let br=[1,…,1,2,…,n−r+1]b_r=[1,\ldots,1,2,\ldots,n-r+1] be the restriction vector with rr initial entries equal to 11 and the remaining entries increasing consecutively. A permutation satisfying the corresponding one-sided restriction is called brb_r-regular. Two cycle indicators are r−1r-1-separated when the distance between the numbers their cycles include is at least r−1r-1.

Independence conjecture. For brb_r-regular permutations, any two cycle indicators are independent if and only if they are r−1r-1-separated.

This conjecture extends the corresponding r=2r=2 independence property to the wider family of one-sided restrictions. Establishing it would help control the more complicated local dependence structure needed for central limit theorems for cycle counts when r>2r>2.

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.