On the maximum of the weighted binomial sum 2^-r_i=0rᵐⁱ
For a non-negative integer \(m \geq 0\), study of the function \(f_m(r) = \frac{1}{2^r} \sum_{i=0}^r \binom{m}{i}\) is of importance in coding and information theory. The authors mention that a back-of-the-envelope calculations by B. McKay in [\textit{S. P. Glasby}, ``On the maximum of the weighted binomial sum \(2^{-r}\sum_{i=0}^r \binom{m}{i}\), MathOverflow, Question 389857, \url{https://mathoverflow.net/questions/389857/maximum-of-the-weighted-binomial-sum-2-r-sum-i-0r-binommi}] indicate that the function has maximum value when \(r\) is close to \(m/3\). In this paper, the authors prove such a precise result and also give bounds for the maximal value. They deduce that the maximum value is asymptotic to \(\frac{3}{\sqrt{\pi m}} \bigg(\frac{3}{2} \bigg)^m\) as \(m \rightarrow \infty\). The methods are elementary.
- Extremal properties of sums of binomial coefficients
- Partial sums of binomial coefficients
- Formulas for weighted binomial sums using the powers of terms of binary recurrences
- On asymptotics of certain sums arising in coding theory
- An inequality for the binary entropy function and an application to binomial coefficients
This page was built for publication: On the maximum of the weighted binomial sum \(2^{-r}\sum_{i=0}^r\binom{m}{i}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138559)
