Generating some restricted classes of permutations
Date
1999
Authors
Lausch, Scott Arno
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
We consider the generation of two categories of permutations. The first category consists of stamp foldings and related objects. A stamp folding is a permutation representing the folding of a linear strip of stamps into a pile. The second category consists of Dumont permutations of both the first and second kind, which are defined by rules based on the parity of the indices and elements. Algorithms which are asymptotically efficient were developed for all objects considered Each algorithm used the technique of recursive backtracking. Also, a possible one-to-one mapping between the two types of Dumont permutations was conjectured.