Unranking permutations in transposition order and linear time
Combinatorics
2008-06-10 v1
Abstract
An algorithm is presented for unranking permutations in transposition order: Given a seed s\in N, the algorithm produces a permutation P(s) that differs from the permutation P(s+1) by the transposition of two elements.
Keywords
Cite
@article{arxiv.0806.1371,
title = {Unranking permutations in transposition order and linear time},
author = {Konstantinos A. Blekos},
journal= {arXiv preprint arXiv:0806.1371},
year = {2008}
}