2000 character limit reached
Entropy Inequalities for Sums in Prime Cyclic Groups (1710.00812v4)
Published 2 Oct 2017 in math.CO, cs.IT, math.IT, math.NT, and math.PR
Abstract: Lower bounds for the R\'enyi 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.