Stack words and a bound for 3-stack sortable permutations

摘要

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. (C) 2020 Elsevier B.V. All rights reserved.