ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SnS_n and SmS_m be symmetric groups, let π\pi be distributed uniformly from either the wreath product Sn≀SmS_n \wr S_m or the Kronecker product Sm⊗SnS_m \otimes S_n, and let hn,mh_{n,m} denote the height of the associated block binary search tree. Write →p\to_p for convergence in probability.

Joint-growth height conjecture. As min⁡(n,m)→∞\min(n,m)\to\infty,

hn,mlog⁡n,log⁡m→pc∗.\frac{h_{n,m}}{\log n\\,\log m}\to_p c^*.

Here c∗≈4.311c^*\approx 4.311 is the constant from Devroye's theorem. This is motivated by the fixed-nn conjecture and the asymptotic relation Hn(1)/log⁡n→1H_n^{(1)}/\log n\to 1; proving the matching result when both parameters grow remains open and would require stronger control of tree-height extremes.

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.