Unranking permutations in transposition order and linear time

Simple item page
dc.creatorBlekos, Konstantinos A.
dc.date2008-06-09
dc.date.accessioned2026-07-07T09:43:20Z
dc.date.available2026-07-07T09:43:20Z
dc.descriptionAn 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.
dc.identifierhttps://arxiv.org/abs/0806.1371
dc.identifierhttp://arxiv.org/abs/0806.1371
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162517
dc.subjectCombinatorics
dc.titleUnranking permutations in transposition order and linear time
dc.typetext

Files

Collections

arXiv