Summary: The following inequality for \(0<p<1\) and \(a_n\geq 0\) originates from a study of \textit{G. H. Hardy}, \textit{J. E. Littlewood} and \textit{G. Pólya} [Inequalities. Cambridge: At the University Press (1988; Zbl 0634.26008)]: \[ \sum_{n-1}^\infty \left(\frac 1n \sum_{k-n}^n a_k\right)^p\geq c_p\sum_{n-1}^\infty a_n^p. \] \textit{V. I. Levin} and \textit{S. B. Stechkin} [Am. Math. Soc., Transl., II. Ser 14, 1--29 (1960; Zbl 0100.04503)] proved the previous inequality with the best constant \(c_p = (p/(1-p)^p)\) for \(0 < p\leq 1/3\). In this paper, we extend the result of Levin and Stechkin to \(0 <p \leq 0.346\).
- A note on Hardy-type inequalities
- Factorizing the classical inequalities
- Hardy-type inequalities via auxiliary sequences
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- Inequalities
- On l^p norms of weighted mean matrices
- On weighted mean matrices whose \(l^{p}\) norms are determined on decreasing sequences
- Sharp bounds for the ratio of q-gamma functions
- The analytic principle of the large sieve
This page was built for publication: On a result of Levin and Stečkin
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539374)
