scientific article; zbMATH DE number 140097

MaRDI QIDQ4028472zbMATH OpenFDO

Authors Lee Davison, Gabriele Guenther

Publication date 28 March 1993

zbMATH Keywords

binary stringscompositions of an integermaximal runsunimodal sequences

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Other combinatorial number theory (11B75) Combinatorics on words (68R15)

Review text

[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)].

Recommendations

• Binary strings of length n with x zeros and longest k-runs of zeros
• scientific article; zbMATH DE number 1431669
• scientific article; zbMATH DE number 878317
• Enumerating binary strings without r-runs of ones
• Codes for a long silence

Cited in

(5)

• Shortest and longest length of success runs in binary sequences
• On the Maximal Sum of Exponents of Runsin a String
• Codes for a long silence
• On the maximal sum of exponents of runs in a string
• scientific article; zbMATH DE number 1431669 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028472)