Independence conjecture for cycle indicators of b_r-regular permutations
Statement
Let and let be the restriction vector with initial entries equal to and the remaining entries increasing consecutively. A permutation satisfying the corresponding one-sided restriction is called -regular. Two cycle indicators are -separated when the distance between the numbers their cycles include is at least .
Independence conjecture. For -regular permutations, any two cycle indicators are independent if and only if they are -separated.
This conjecture extends the corresponding 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 .
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.