266 citations · 723 across the 48 of their papers we have counts for
Showing 2019 · math.COShow all
2 papers · 2 filters
math.CO2019
Stack words and a bound for 3-stack sortable permutations
Miklos Bona
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 w…
math.CO2019
Pattern avoidance in permutations and their squares
Miklos Bona, Rebecca Smith
We study permutations such that both and avoid a given pattern . We obtain a generating function for the case of (equivalently, ), we prove that if…