Average length of the longest k-alternating subsequence
Abstract
We prove a conjecture of Drew Armstrong on the average maximal length of k-alternating subsequence of permutations. The k=1 case is a well-known result of Richard Stanley.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.