Rule based lexicographical permutation sequences
Data Structures and Algorithms
2015-05-04 v1
Abstract
In a permutation sequence built by means of sub permutations the transition between successive permutations are subject to a set of n(n - 1)/2 rules that group into n - 1 matrices with a high degree of regularity. By means of these rules the sequence can be produced in O(3n!) time and O(n^3) space.
Keywords
Cite
@article{arxiv.1505.00001,
title = {Rule based lexicographical permutation sequences},
author = {Asbjørn Brændeland},
journal= {arXiv preprint arXiv:1505.00001},
year = {2015}
}
Comments
4 pages