-
Corvinus Matematika tanszék, "Szép Jenő terem"
-
-
-
-
-
-
Description
A long-standing open (and difficult!) problem is to characterize
and enumerate permutations that can be sorted using two stacks connected
in series. We will present some nice algorithmic and combinatorial results in
the case in which the stacks have to obey some restrictions on their contents.