✦ LIBER ✦

Complete enumerations and double sequences

✍ Scribed by M. Adrian Carpentier

Publisher: John Wiley and Sons
Year: 1969
Tongue: English
Weight: 360 KB
Volume: 15
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19690150102

No coin nor oath required. For personal study only.

✦ Synopsis

COMPLETE ENUMERATIONS AND DOUBLE SEQUENCES l )

by M. ADRIAN CARPENTIER in Notre Dame, Indiana (U.S.A.)

A. E. MALCEV has defined complete enumerations and shown a correspondence between these and universal sequences of sets [3], this latter concept being equivalent to creativity for disjoint recursively enumerable (r.e.) sequences. This paper presents a generalization to double sequences of MALCEV'S work. We give first some remarks on notation and preliminary definitions.

📜 SIMILAR VOLUMES

Score sequences: Lexicographic enumerati

Score sequences: Lexicographic enumeration and tournament construction

✍ S.V. Gervacio 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Pattern spectra, substring enumeration,

Pattern spectra, substring enumeration, and automatic sequences

✍ Jean-Paul Allouche; Patrick Morton; Jeffrey Shallit 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 672 KB

Complete enumeration of pure-level and m

Complete enumeration of pure-level and mixed-level orthogonal arrays

✍ Eric D. Schoen; Pieter T. Eendebak; Man V. M. Nguyen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract We specify an algorithm to enumerate a minimum complete set of combinatorially non‐isomorphic orthogonal arrays of given strength __t__, run‐size __N__, and level‐numbers of the factors. The algorithm is the first one handling general mixed‐level and pure‐level cases. Using an implement

Langford sequences: Some connections wit

Langford sequences: Some connections with complete and additive permutations

✍ Sadao Saito; Takanori Hayasaka 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 444 KB

We explore the relations between Langford (2, m, 3m)-sequences on the one hand and complete and addtive permutations on the other. We consider in this context permutations with a certain "splitting" property and report on the results of some computer studies.

Enumerating 4 x 5 and 5 x 6 double Youde

Enumerating 4 x 5 and 5 x 6 double Youden rectangles

✍ C. Christofi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Correction to: Complete enumeration of p

Correction to: Complete enumeration of pure-level and mixed-level orthogonal arrays

✍ Eric D. Schoen; Pieter T. Eendebak; Man V. M. Nguyen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 32 KB