Joint-growth height conjecture for wreath and Kronecker products
Statement
Let and be symmetric groups, let be distributed uniformly from either the wreath product or the Kronecker product , and let denote the height of the associated block binary search tree. Write for convergence in probability.
Joint-growth height conjecture. As ,
Here is the constant from Devroye's theorem. This is motivated by the fixed- conjecture and the asymptotic relation ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.