Longest alternating subsequences of k-ary words

Recently, Stanley [13] studied the length of the longest alternating subsequence of a permutation in the symmetric group, where a sequence a, b, c, d, . . . is alternating if a > b < c > d <

• Type: Journal
• Year: 2008
• Where: DAM
• Authors: Toufik Mansour
• Keywords: DAM 2008, K-ary Word, Longest Alternating Subsequence, Symmetric Group