Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones (Q2639858): Difference between revisions
From MaRDI portal
Latest revision as of 11:40, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones |
scientific article |
Statements
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones (English)
0 references
1991
0 references
The reviewer [J. Comb. Theory, Ser. A 47, 176-190 (1988)] derived recursive formulas and generating functions for the number of binary vectors in n space containing exactly k isolated m-tuples of consecutive ones. This note studies the same problem except that the word ``isolated'' is changed to ``nonoverlapping,'' so two m-tuples are allowed to be adjacent. A closed-form solution is given, the result is extended to cyclic binary vectors, and an application is made to a reliability model.
0 references
recursive formulas
0 references
generating functions
0 references
number of binary vectors
0 references
isolated m-tuples of consecutive ones
0 references
reliability model
0 references
0 references
