Armstrong's conjecture on the longest k-alternating subsequence
Statement
Let be uniformly distributed in , and let denote the length of its longest -alternating subsequence, where a subsequence is -alternating if its successive entries alternate in direction and each successive jump has absolute value at least . Armstrong's conjecture. For all and ,
Armstrong made this conjecture and verified it by exact computation for certain small values of and . The case 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.