Notes on a problem involving permutations as subsequences.

  • Authors:

  • Malcolm C. Newey

  • Affiliations:

  • -

  • Venue:
  • Notes on a problem involving permutations as subsequences.
  • Year:
  • 1973

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem (attributed to R. M. Karp by Knuth) is to describe the sequences of minimum length which contain, as subsequences, all the permutations of an alphabet of n symbols. This paper catalogs some of the easy observations on the problem and proves that the minimum lengths for n=5, n=6 & n=7 are 19, 28 and 39 respectively. Also presented is a construction which yields (for n