Asymptotic independence of descent sets and being an n-cycle
Statement
For each , let , and let denote the number of permutations in with descent set , while denotes the number of -cycles with descent set . Asymptotic independence conjecture.
This asserts that, uniformly over all non-empty proper descent sets, having descent set and being an -cycle are asymptotically independent, with the proportion of -cycles tending to as it does among all permutations. The source presents this as a conjectural strengthening of the known asymptotic independence result for alternating permutations.
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.