Counting permutations by alternating descents

TL;DR

This paper derives the exponential generating function for permutations with specific valley and peak parity conditions, providing asymptotic analysis and multiple proofs, and extends permutation enumeration formulas to an alternating context.

Contribution

It introduces a new generating function for permutations with all valleys even and peaks odd, and offers two proofs, expanding the scope of permutation enumeration techniques.

Findings

Derived the exponential generating function involving Euler numbers.

Provided asymptotic formulas for the coefficients.

Extended permutation enumeration results to alternating cases.

Abstract

We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can be expressed as the reciprocal of a sum involving Euler numbers. We give two proofs of the formula. The first uses a system of differential equations. The second proof derives the generating function directly from general permutation enumeration techniques, using noncommutative symmetric functions. The generating function is an "alternating" analogue of David and Barton's generating function for permutations with no increasing runs of length 3 or more. Our general results give further alternating analogues of permutation enumeration formulas, including results of Chebikin and Remmel.