No label defined (Q4028472)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 140097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 140097 |
Statements
28 March 1993
0 references
maximal runs
0 references
compositions of an integer
0 references
unimodal sequences
0 references
binary strings
0 references
0.7541415095329285
0 references
0.7257120013237
0 references
0.7241722941398621
0 references
[For the entire collection see Zbl 0747.00033.] For two integers \(k\) and \(n\), with \(n \geq k\), let \(f(n,k)\) be the number of binary strings of length \(n\) with exactly \(k\) consecutive 1's. The authors prove that the sequence \((f(n,k))_{0 \leq k \leq n}\) is unimodal and that it reaches its maximum for \(k = \lfloor\log_ 2 n\rfloor - 1\) or \(k = \lfloor \log_ 2n\rfloor\). The proof is elementary but ingenious. Note that, as indicated by the authors, this result has been obtained independently by Odlyzko and Richmond who studied the number of compositions of \(n\) with maximum part \(k\) [\textit{A. M. Odlyzko} and \textit{B. Richmond}, Lect. Notes Math. 829, 199-210 (1980; Zbl 0451.05009)].
0 references
