| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655115 | Journal of Combinatorial Theory, Series A | 2015 | 7 Pages |
Abstract
We prove a conjecture of Drew Armstrong on the average maximal length of k -alternating subsequence of permutations. The k=1k=1 case is a well-known result of Richard Stanley.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tommy Wuxing Cai,