The enumeration of permutations sortable by pop stacks in parallel

Authors:
Rebecca Smith;Vincent Vatter
Affiliations:
Department of Mathematics, SUNY Brockport, Brockport, NY 14420, USA;Department of Mathematics, Dartmouth College, Hanover, NH 03755, USA
Venue:
Information Processing Letters
Year:
2009

Citing 6
Cited 1

Pop-stacks in parallel

Information Processing Letters
Sorting Using Networks of Queues and Stacks

Journal of the ACM (JACM)
The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set
Restricted permutations and the wreath product

Discrete Mathematics
Computing permutations with double-ended queues, parallel stacks and parallel queues

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Partition and composition matrices

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that the set of permutations sortable by k pop stacks in parallel has a regular insertion encoding and construct the (finite) recognizing automaton for this language. This shows that these permutations have a rational generating function, verifying a conjecture of Atkinson and Sack.