Let count alternating permutations on labels, with . For ,
Count both up-down and down-up permutations of labels. Choose the labels left of the maximum in ways. On either side, the comparison next to the maximum fixes which alternating direction is required, giving choices. Conversely these choices reconstruct exactly one of the two kinds of alternating permutations. Replacing each label by interchanges the two kinds, so their combined count is .
For , the identity reads . The restriction matters: on one label, the two alternating conventions describe the same permutation, and substitution of would incorrectly give .

Articles by others on the same topic (0)

There are currently no matching articles.