ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let π\pi be uniformly distributed in Sn{\mathcal S}_n, and let Ln,k=Ln,k(π)L_{n,k}=L_{n,k}(\pi) denote the length of its longest kk-alternating subsequence, where a subsequence is kk-alternating if its successive entries alternate in direction and each successive jump has absolute value at least kk. Armstrong's conjecture. For all n≥2n\geq 2 and k∈{1,…,n−1}k\in\{1,\ldots,n-1\},

ELn,k=4(n−k)+56.\mathbb{E}L_{n,k}=\frac{4(n-k)+5}{6}.

Armstrong made this conjecture and verified it by exact computation for certain small values of nn and kk. The case k=1k=1 recovers the known mean of the longest alternating subsequence; the general assertion remains open in the source.

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.