Abstract
There is a natural bijection between permutations obtainable using a stack (those avoiding the pattern 312) and permutations obtainable using a queue (those avoiding 321). This bijection is equivalent to one described by Simion and Schmidt in 1985. We argue that this bijection might well have been found back in 1968 by readers of volume 1 of Knuth's *The Art of Computer Programming*, if Knuth had not assigned difficulty ratings to his exercises.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.