2000 character limit reached
A generalization of Boppana's entropy inequality
Published 27 Jan 2026 in math.CO and cs.IT | (2601.19327v1)
Abstract: In recent progress on the union-closed sets conjecture, a key lemma has been Boppana's entropy inequality: $h(x2)\geφxh(x)$, where $φ=(1+\sqrt5)/2$ and $h(x)=-x\log x-(1-x)\log(1-x)$. In this note, we prove that the generalized inequality $α_kh(xk)\ge x{k-1}h(x)$, first conjectured by Yuster, holds for real $k>1$, where $α_k$ is the unique positive solution to $x(1+x){k-1}=1$. This implies an analogue of the union-closed sets conjecture for approximate $k$-union closed set systems. We also formalize our proof in Lean 4.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.