DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
ADA010085
Title:
Shortest String Containing all Permutations.
Corporate Author:
WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Report Date:
1975-02-01
Abstract:
In this paper, the authors consider the problem of constructing a shortest string of the set 1,2, ..., n containing all permutations on n elements as subsequences. For example, the string 1 2 1 3 1 2 1 contains the 6 3 factorial permutations of the set 1,2,3 and no string with less than 7 digits contains all the six permutations. Note that a given permutation, such as 1 2 3, does not have to be consecutive but must be from left to right in the string.
Descriptive Note:
Technical summary rept.,
Pages:
0017
Contract Number:
DA-31-124-ARO-D-462
File Size:
0.00MB
