|
Organizers |
Sorting with stacks in series
by
Mike Atkinson
University of Otago
Coauthors: Nik Ruskuc (University of St Andrews), Maximillian Murphy (University of St Andrews)
The permutations that can be sorted by two stacks in series are considered, subject to the condition that each stack remains ordered. A forbidden characterisation of such permutations is obtained and the number of permutations of each length is determined by a generating function.
Date received: August 9, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafn-06.