Abstract
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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Generalized Coloring of Permutations;Algorithmica;2024-03-29
2. Longest Increasing Subsequences and Log Concavity;Annals of Combinatorics;2017-08-19
3. Reduced word manipulation: patterns and enumeration;Journal of Algebraic Combinatorics;2017-04-03
4. Mean and Insensitive. Random Permutations;Combinatorics of Permutations;2016-04-19
5. Geometric grid classes of permutations;Transactions of the American Mathematical Society;2013-04-25