On Han- and Shearer-Type Information Inequalities: Equality Conditions and Combinatorial Applications
Information Theory
Summary
The gist is being written…
Authors
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara, Vinod M. Prabhakaran
Abstract
Madiman and Tetali established strong and weak fractional inequalities that subsume classical entropy subset inequalities such as Han's inequality and Shearer's lemma. In this work, we derive a decomposition of the gap in the strong fractional inequality and use it to establish the necessary and sufficient conditions for equality in the strong form of Han's inequality. As a consequence, we characterize the equality conditions for a strong Loomis-Whitnet-type projection inequality of Balister and Bollobas (2012). Finally, we apply the weak fractional inequality to an extremal graph theory problem, recovering and extending results of Sason (2022) and Boucheron et al. (2013), whose approaches rely on Han's inequality.