ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each nn, let [n−1]={1,…,n−1}[n-1]=\{1,\ldots,n-1\}, and let βn(I)\beta_n(I) denote the number of permutations in SnS_n with descent set I⊆[n−1]I\subseteq[n-1], while βncyc(I)\beta^{\mathrm{cyc}}_n(I) denotes the number of nn-cycles with descent set II. Asymptotic independence conjecture.

lim⁡n→∞max⁡∅⫋I⫋[n−1]∣n βncyc(I)βn(I)−1∣=0.\lim_{n\to\infty}\max_{\varnothing \subsetneqq I \subsetneqq [n-1]} \left| \frac{n\, \beta^{\mathrm{cyc}}_n(I)}{\beta_n(I)} - 1\right| = 0.

This asserts that, uniformly over all non-empty proper descent sets, having descent set II and being an nn-cycle are asymptotically independent, with the proportion of nn-cycles tending to 1/n1/n 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 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.