2015/04/29 by Asbjørn Brændeland, Brændeland, Asbjørn
Arts and Humanities · Computer Science · #Lexicography and Language Studies #Natural Language Processing Techniques #cs.DS
paper · pdf · doi:10.48550/arxiv.1505.00001
4 pages
arxiv created 2015/04/29 · arxiv updated 2015/05/04
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(n3) space.