A proof of the Prelov conjecture

07/31/2023
by   Yi C. Huang, et al.
0

In this paper we present a complete proof of a conjecture due to V. V. Prelov in 2010 about an information inequality for the binary entropy function.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/23/2023

A Useful Inequality for the Binary Entropy Function

We provide a simple proof of a curious inequality for the binary entropy...
research
03/31/2022

A Proof of the Kahn-Kalai Conjecture

We prove the "expectation-threshold" conjecture of Kahn and Kalai....
research
05/31/2023

A family of Counterexamples on Inequality among Symmetric Functions

Inequalities among symmetric functions are fundamental questions in math...
research
10/23/2018

A proof of the Shepp-Olkin entropy monotonicity conjecture

Consider tossing a collection of coins, each fair or biased towards head...
research
10/23/2017

A short proof of the middle levels theorem

Consider the graph that has as vertices all bitstrings of length 2n+1 wi...
research
06/02/2020

A combinatorial conjecture from PAC-Bayesian machine learning

We present a proof of a combinatorial conjecture from the second author'...
research
12/02/2019

Idealness of k-wise intersecting families

A clutter is k-wise intersecting if every k members have a common elemen...

Please sign up or login with your details

Forgot password? Click here to reset