𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gray code sequences of partitions

✍ Scribed by Carla D Savage

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
740 KB
Volume
10
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Construction of a superimposed code usin
Construction of a superimposed code using partitions
✍ Vladimir Ufimtsev πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 102 KB

This paper will focus on the construction of superimposed codes using incidence matrices. Such constructions require a set of elements and a partial order defined on the set. We will define a partial order on partitions. The construction will be made using elements from the partially ordered set of

Partitions of the set of finite sequence
Partitions of the set of finite sequences
✍ MarΓ­a Carrasco; Carlos Augusto Di Prisco; AndrΓ©s MillΓ‘n πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 685 KB
Optimal Partitioning of Sequences
Optimal Partitioning of Sequences
✍ F. Manne; T. Sorevik πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 621 KB

The problem of partitioning a sequence of \(n\) real numbers into \(p\) intervals is considered. The goal is to find a partition such that the cost of the most expensive interval measured with a cost function \(f\) is minimized. An efficient algorithm which solves the problem in time \(O((n-p) p \lo

Transitive partitions in realizations of
Transitive partitions in realizations of tournament score sequences
✍ Arthur H. Busch; Guantao Chen; Michael S. Jacobson πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 121 KB

## Abstract A tournament is an oriented complete graph, and one containing no directed cycles is called __transitive__. A tournament __T__=(__V, A__) is called __m__‐__partition transitive__ if there is a partition such that the subtournaments induced by each __X__~__i__~ are all transitive, an