Stack words and a bound for 3-stack sortable permutations
Combinatorics
2020-01-23 v4
Abstract
We use stack words to find a new, simple proof for the best known upper bound for the number of 3-stack sortable permutations of a given length. This is the first time that stack words are used to obtain such a result.
Cite
@article{arxiv.1903.04113,
title = {Stack words and a bound for 3-stack sortable permutations},
author = {Miklos Bona},
journal= {arXiv preprint arXiv:1903.04113},
year = {2020}
}
Comments
6 pages