Entropy Inequalities for Sums in Prime Cyclic Groups

October 02, 2017 ยท The Ethereal ยท ๐Ÿ› SIAM Journal on Discrete Mathematics

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Mokshay Madiman, Liyao Wang, Jae Oh Woo arXiv ID 1710.00812 Category math.CO: Combinatorics Cross-listed cs.IT, math.NT, math.PR Citations 16 Venue SIAM Journal on Discrete Mathematics Last Checked 2 months ago
Abstract
Lower bounds for the Rรฉnyi entropies of sums of independent random variables taking values in cyclic groups of prime order under permutations are established. The main ingredients of our approach are extended rearrangement inequalities in prime cyclic groups building on Lev (2001), and notions of stochastic ordering. Several applications are developed, including to discrete entropy power inequalities, the Littlewood-Offord problem, and counting solutions of certain linear systems.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Combinatorics

๐Ÿ”ฎ ๐Ÿ”ฎ The Ethereal

Tables of subspace codes

Daniel Heinlein, Michael Kiermaier, ... (+2 more)

math.CO ๐Ÿ› arXiv ๐Ÿ“š 94 cites 10 years ago