On Han- and Shearer-Type Information Inequalities: Equality Conditions and Combinatorial Applications
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.
Create a lesson
Related papers
Optimal Support Size Testing
Qisheng Wang
Dynamic Attack Surfaces: A Queue of Branching Processes
Ismail Cosandal, Abdullah Y. Etcibasi, C. Emre Koksal et al.
Solomonoff induction of selected bits and online classification
Bruno Bauwens, German Kuznetsov
Rate-Splitting Multiple Access for RIS-Enabled Full-Duplex Communications with User Relaying
Yuwen Cao, Hui Wang, Tomoaki Ohtsuki et al.
Full classification of Zps-linear generalized Hadamard codes
Dipak K. Bhunia
Deterministic Distributed Linearly Separable Computation via Nested Cyclic Codes
Anu Mathew, M. Nikhil Krishnan