Longest alternating subsequences of permutations

Simple item page
dc.creatorStanley, Richard P.
dc.date2005-11-16
dc.date.accessioned2026-07-07T06:51:21Z
dc.date.available2026-07-07T06:51:21Z
dc.descriptionThe length is(w) of the longest increasing subsequence of a permutation w in the symmetric group S_n has been the object of much investigation. We develop comparable results for the length as(w) of the longest alternating subsequence of w, where a sequence a,b,c,d,... is alternating if a>b<c>d<.... For instance, the expected value (mean) of as(w) for w in S_n is exactly (4n+1)/6 if n>1.
dc.description19 pages
dc.identifierhttps://arxiv.org/abs/math/0511419
dc.identifierhttp://arxiv.org/abs/math/0511419
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104955
dc.subjectCombinatorics
dc.subject05A15
dc.titleLongest alternating subsequences of permutations
dc.typetext

Files

Collections

arXiv