Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 46 min ago
PreprintarXiv licencearXiv

On Han- and Shearer-Type Information Inequalities: Equality Conditions and Combinatorial Applications

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.

Related

  1. Testing Equality of Distributions via Repeatedly Integrated Quantile Metrics Under Weak Moment Conditions
    Zhenfeng Zou, Meng Guan, Panxu Yuan +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. The Combinatorial Loewner Property and Super-Multiplicativity Inequalities for Symmetric Self-Similar Metric Spaces
    Riku Anttila, Sylvester David Eriksson-Bique
    Potential AnalysisPeer-reviewedCC BYFull text11 citedGeneral mathematicsOpenAlex
  3. Divergence-Free Approximation in Sobolev and Lebesgue Spaces on General Unbounded Domains with Applications to Energy Equality in Fluid Dynamics
    Akram Khan, Sagar Gautam, Manil T. Mohan
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Three-point orbits of 2-transitive groups and their combinatorial applications
    Zhilin Zhang
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. Learning to Cover Locally: Graph Neural Combinatorial Optimization under a Hard Information Horizon
    Johannes F. Loevenich, Thies Moehlenhof, Laurin Holz +3
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{jakhar2026shearertype,
  title = {{On Han- and Shearer-Type Information Inequalities: Equality Conditions and Combinatorial Applications}},
  author = {Gunank Jakhar and Gowtham R. Kurri and Suryajith Chillara and Vinod M. Prabhakaran},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.18693},
  eprint = {2610.18693},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.18693},
}
RIS
TY  - UNPB
TI  - On Han- and Shearer-Type Information Inequalities: Equality Conditions and Combinatorial Applications
AU  - Gunank Jakhar
AU  - Gowtham R. Kurri
AU  - Suryajith Chillara
AU  - Vinod M. Prabhakaran
PY  - 2026
DA  - 2026/10/13
PB  - arXiv
DO  - 10.48550/arxiv.2610.18693
UR  - https://arxiv.org/abs/2610.18693
AB  - 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.
ER  -