Stackable and queueable permutations

Details Stackable and queueable permutations Stackable and queueable permutations

2012-01-31

arxiv.org/abs/1201.6580v1

Mathematics

Combinatorics

Public domain

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Stackable and queueable permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stackable and queueable permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stackable and queueable permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57266