Average length of the longest k-alternating subsequence

作者:Cal Tommy Wuxing*
来源:Journal of Combinatorial Theory - Series A, 2015, 134: 51-57.
DOI:10.1016/j.jcta.2015.03.003

摘要

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.