Alternating permutation

In combinatorial mathematics, an alternating permutation (or zigzag permutation) of the set {1, 2, 3, ..., n} is a permutation (arrangement) of those numbers so that each entry is alternately greater or less than the preceding entry. For example, the five alternating permutations of {1, 2, 3, 4} are: This type of permutation was first studied by Désiré André in the 19th century.
 * 1, 3, 2, 4       because       1 < 3 > 2 < 4,
 * 1, 4, 2, 3       because       1 < 4 > 2 < 3,
 * 2, 3, 1, 4       because       2 < 3 > 1 < 4,
 * 2, 4, 1, 3       because       2 < 4 > 1 < 3, and
 * 3, 4, 1, 2       because       3 < 4 > 1 < 2.

Different authors use the term alternating permutation slightly differently: some require that the second entry in an alternating permutation should be larger than the first (as in the examples above), others require that the alternation should be reversed (so that the second entry is smaller than the first, then the third larger than the second, and so on), while others call both types by the name alternating permutation.

The determination of the number An of alternating permutations of the set {1, ..., n} is called André's problem. The numbers An are known as Euler numbers, zigzag numbers, or up/down numbers. When n is even the number An is known as a secant number, while if n is odd it is known as a tangent number. These latter names come from the study of the generating function for the sequence.

Definitions
A permutation $c_{1}, ..., c_{n}$ is said to be alternating if its entries alternately rise and descend. Thus, each entry other than the first and the last should be either larger or smaller than both of its neighbors. Some authors use the term alternating to refer only to the "up-down" permutations for which $c_{1} < c_{2} > c_{3} < ...$, calling the "down-up" permutations that satisfy $c_{1} > c_{2} < c_{3} > ...$ by the name reverse alternating. Other authors reverse this convention, or use the word "alternating" to refer to both up-down and down-up permutations.

There is a simple one-to-one correspondence between the down-up and up-down permutations: replacing each entry $c_{i}$ with $n + 1 - c_{i}$ reverses the relative order of the entries.

By convention, in any naming scheme the unique permutations of length 0 (the permutation of the empty set) and 1 (the permutation consisting of a single entry 1) are taken to be alternating.

André's theorem


The determination of the number An of alternating permutations of the set {1, ..., n} is called André's problem. The numbers An are variously known as Euler numbers, zigzag numbers, up/down numbers, or by some combinations of these names. The name Euler numbers in particular is sometimes used for a closely related sequence. The first few values of An are 1, 1, 1, 2, 5, 16, 61, 272, 1385, 7936, 50521, ... .

These numbers satisfy a simple recurrence, similar to that of the Catalan numbers: by splitting the set of alternating permutations (both down-up and up-down) of the set { 1, 2, 3, ..., n, n + 1 } according to the position k of the largest entry $n + 1$, one can show that


 * $$ 2A_{n+1} = \sum_{k=0}^n \binom{n}{k} A_k A_{n-k}$$

for all $n ≥ 1$. used this recurrence to give a differential equation satisfied by the exponential generating function


 * $$ A(x) = \sum_{n=0}^\infty A_n \frac{x^n}{n!}$$

for the sequence $A_{n}$. In fact, the recurrence gives:

2\sum_{n\geq 1} A_{n+1} \frac{x^{n+1}}{(n+1)!} = \sum_{n\geq 1} \sum_{k=0}^n \frac{A_k}{k!} \frac{A_{n-k}}{(n-k)!} \frac{x^{n+1}}{n+1} = \int \left(\sum_{k\geq 0}A_k \frac{x^k}{k!}\right) \left(\sum_{j\geq 0}A_j \frac{x^j}{j!}\right) \, dx - x $$ where we substitute $$j = n-k$$ and $$\frac{x^{n+1}}{n+1}=\int x^{k+j}\,dx$$. This gives the integral equation

2(A(x) - 1 - x) = \int A(x)^2\,dx - x, $$ which after differentiation becomes $$2\frac{dA}{dx} - 2 = A^2-1$$. This differential equation can be solved by separation of variables (using the initial condition $$A(0)=A_0/0!=1$$), and simplified using a tangent half-angle formula, giving the final result


 * $$ A(x) = \tan \left(\frac\pi4 + \frac x2\right) = \sec x + \tan x$$,

the sum of the secant and tangent functions. This result is known as André's theorem. A geometric interpretation of this result can be given using a generalization of a theorem by Johann Bernoulli

It follows from André's theorem that the radius of convergence of the series $A(x)$ is $\pi$/2. This allows one to compute the asymptotic expansion


 * $$ A_n \sim 2 \left(\frac{2}{\pi}\right)^{n + 1} n!\,. $$

Related sequences
The odd-indexed zigzag numbers (i.e., the tangent numbers) are closely related to Bernoulli numbers. The relation is given by the formula


 * $$B_{2n} =(-1)^{n-1}\frac{2n}{4^{2n}-2^{2n}} A_{2n-1}$$

for n > 0.

If Zn denotes the number of permutations of {1, ..., n} that are either up-down or down-up (or both, for n < 2) then it follows from the pairing given above that Zn = 2An for n ≥ 2. The first few values of Zn are 1, 1, 2, 4, 10, 32, 122, 544, 2770, 15872, 101042, ... .

The Euler zigzag numbers are related to Entringer numbers, from which the zigzag numbers may be computed. The Entringer numbers can be defined recursively as follows:
 * $$ E(0,0) = 1 $$
 * $$ E(n,0) = 0 \qquad \mbox{for } n > 0 $$
 * $$ E(n,k) = E(n, k-1) + E(n-1, n-k) $$.

The nth zigzag number is equal to the Entringer number E(n, n).

The numbers A2n with even indices are called secant numbers or zig numbers: since the secant function is even and tangent is odd, it follows from André's theorem above that they are the numerators in the Maclaurin series of $sec x$. The first few values are 1, 1, 5, 61, 1385, 50521, ... .

Secant numbers are related to the signed Euler numbers (Taylor coefficients of hyperbolic secant) by the formula E2n = (&minus;1)nA2n. (En = 0 when n is odd.)

Correspondingly, the numbers A2n+1 with odd indices are called tangent numbers or zag numbers. The first few values are 1, 2, 16, 272, 7936, ... .

Explicit formula in terms of Stirling numbers of the second kind
The relationships of Euler zigzag numbers with the Euler numbers, and the Bernoulli numbers can be used to prove the following


 * $$ A_{r}=-\frac{4^{r}}{a_{r}} \sum_{k=1}^{r}\frac{(-1)^{k}\, S(r,k)}{k+1}\left(\frac{3}{4}\right)^{(k)} $$

where
 * $$ a_{r}=\begin{cases} (-1)^{\frac{r-1}{2}}(1+2^{-r}) &\mbox{if r is odd} \\

(-1)^{\frac{r}{2}} & \mbox{if r is even} \end{cases}, $$ $$(x)^{(n)}=(x)(x+1)\cdots (x+n-1)$$ denotes the rising factorial, and $$ S(r,k) $$ denotes Stirling numbers of the second kind.