A proof of the Prelov conjecture
July 31, 2023 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Yi C. Huang, Fei Xue
arXiv ID
2307.16390
Category
math.CA
Cross-listed
cs.IT
Citations
0
Venue
arXiv.org
Last Checked
3 months ago
Abstract
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.CA
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Time Coupled Diffusion Maps
R.I.P.
π»
Ghosted
Random Tessellations, Restricted Isometric Embeddings, and One Bit Sensing
R.I.P.
π»
Ghosted
Generalized Matrix Spectral Factorization and Quasi-tight Framelets with Minimum Number of Generators
R.I.P.
π»
Ghosted
An improved uncertainty principle for functions with symmetry
R.I.P.
π»
Ghosted
Additive energy, uncertainty principle and signal recovery mechanisms
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted