ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let

be a uniformly random permutation of $[n]$, and let $MHS_k$ denote the minimum number of max $k$-heapable subsequences into which

can be partitioned. For each integer kk\boldsymbol{}, the normalized expected number of heaps is considered as nn tends to infinity.

Istrate's scaling conjecture. For every k\boldsymbol{ there exists k>0_k>0 such that, as n\to\boldsymbol{\frac{E[MHS_k]}{(n)} converges to k_k. Moreover, 2=1+52_2=\frac{1+{5}}{2} is the golden ratio.

The conjecture concerns the logarithmic scaling of the minimum number of heapable subsequences in a random permutation. The existence of k_k was subsequently proved, so the claim is solved; the golden-ratio value for k=2k=2 is included in the resolved statement.

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.