English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We provide a simple proof of a curious inequality for the binary entropyfunction, an inequality that has been used in two different contexts. In the1980's, Boppana used this entropy inequality to prove lower bounds on Booleanformulas. More recently, the inequality was used to achieve major progress onFrankl's union-closed sets conjecture. Our proof of the entropy inequality usesbasic differential calculus.

A Useful Inequality for the Binary Entropy Function