17 citations · 24 across the 8 of their papers we have counts for
9 papers · 1 filter
Almost avoiding permutations
Robert Brignall, Shalosh B. Ekhad, Rebecca Smith +1
We investigate the notion of almost avoiding a permutation: almost avoids if one can remove a single entry from to obtain a -avoiding permutation.
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…
Passing through a stack times with reversals
Toufik Mansour, Howard Skogman, Rebecca Smith
We consider a stack sorting algorithm where only the appropriate output values are popped from the stack and then any remaining entries in the stack are run through the stack in re…
Two-stack-sorting with pop stacks
Lara Pudwell, Rebecca Smith
We consider the set of permutations that are sorted after two passes through a pop stack. We characterize these permutations in terms of forbidden patterns (classical and barred) a…
An Involution on Involutions and a Generalization of Layered Permutations
Miklos Bona, Rebecca Smith
Taking transposes of Standard Young Tableaux defines a natural involution on the set of involutions of length via the the Robinson-Schensted correspondence. In some case…
A Bijection on Classes Enumerated by the Schröder Numbers
Michael W. Schroeder, Rebecca Smith
We consider a sorting machine consisting of two stacks in series where the first stack has the added restriction that entries in the stack must be in decreasing order from top to b…