On a conjecture of Lamkin and Tkocz: Log-convexity of moments of Bernoulli sample means
Abstract
Let X1,X2,… be independent Bernoulli(θ) random variables, and let Xn = n-1(X1 + ·s + Xn). We prove that, for every real p ≥ 1, the sequence \E( Xnp)\n ≥ 1 is log-convex. This settles the Bernoulli case of a conjecture of Lamkin and Tkocz [Canad. Math. Bull., 65(2):271-278, 2022]. The proof conditions on the total number of successes among 2n trials and reduces the desired inequality to a convex-order comparison for a normalized quadratic function of a hypergeometric random variable. The log-convexity inequality is strict for p > 1 and 0 < θ< 1.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.