✦ LIBER ✦

On strings containing all subsets as substrings

✍ Scribed by Witold Lipski Jr.

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 998 KB
Volume: 21
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90157-7

No coin nor oath required. For personal study only.

✦ Synopsis

Let s,, be the length of a shortest sequence cf positive integers which contains every Yc(l,..., d}-as a subsequence of IY 1 consecutive terms. We give the following asymptotic estimation* (2/7rnY22" d S .

n Q (2/7r)2". TIC. upper bound is derived constructively.

📜 SIMILAR VOLUMES

A new bound on the length of the shortes

A new bound on the length of the shortest string containing all r-permutations

✍ Cai Mao-cheng 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 196 KB

The purpose of this note is to give a new upper bound of the shortest string containing all r-permutations. Thus we disprove the conjecture considered in Cl]. The terminology used in this note fullows [I]. Koutas and Nu [I] proposed the foIlowing problem of constructing a shortest string of (1, 2,

A Bibliography of Colloid Chemistry.—By

A Bibliography of Colloid Chemistry.—By Harry N. Holmes. The National Research Council has Recently Issued a Colloid Bibliography in Mimeographed form. The Author, Dr. Harry N. Holmes of Oberlin College, Chairman of the National Research Council Committee on the Chemistry of Colloids, Intends this Edition to be Preliminary to a More Comprehensive one. Yet it is a Book of 135 Pages Containing 1800 References on 106 Topics. All the References are Classified and Many are Accompanied by Brief Comment as an aid in Deciding on their Relative Importance. This book of 135 Pages may be Purchased from the Washington Office at $1.00

📂 Article 📅 1923 🏛 Elsevier ⚖ 94 KB 👁 1 views