Short strings containing all k-element permutations

  title={Short strings containing all k-element permutations},
  author={Carla Savage},
  journal={Discrete Mathematics},
The r~-oblem of constructing a string over the set -~n = { 1 , 2 , . . . , n} which contai~ls every permutation of the string 12 •. • n as a subsequence (not necessarily con~;e~etive) was considered in [1], [2] and [3]. Let f(n) denote the length of a shortest ~:uch string. In all three papers it was shown constructively that f(n)<~ n 2 o 2: n ~ 4. in this paper we consider a generalization of this problem: given n and k, con.~truct a string over ~ , which contains every permutation of each k… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-3 of 3 references

Short permutation stlings

L. Adelman
Discrete Math • 1974
View 4 Excerpts
Highly Influenced

On permutation embedding sequences

G. Galbiati, F. P. Preparata
SIAM J. Appl. Math • 1976
View 1 Excerpt

Shortest string containing all permutations

Discrete Mathematics • 1975
View 2 Excerpts

Similar Papers

Loading similar papers…