Permutations which are the union of an increasing and a decreasing subsequence
The electronic journal of combinatorics, Tome 5 (1998)
It is shown that there are ${2n\choose n}-\sum_{m=0}^{n-1}2^{n-m-1}{2m\choose m}$ permutations which are the union of an increasing sequence and a decreasing sequence.
@article{10_37236_1344,
author = {M. D. Atkinson},
title = {Permutations which are the union of an increasing and a decreasing subsequence},
journal = {The electronic journal of combinatorics},
year = {1998},
volume = {5},
doi = {10.37236/1344},
zbl = {0885.05011},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1344/}
}
M. D. Atkinson. Permutations which are the union of an increasing and a decreasing subsequence. The electronic journal of combinatorics, Tome 5 (1998). doi: 10.37236/1344
Cité par Sources :