Entropy and set cardinality inequalities for partition-determined functions

Random Structures and Algorithms

Volumn 40, Issue 4, 2012, Pages 399-424

  Madiman, Mokshay ^a   Marcus, Adam W ^a   Tetali, Prasad ^b  

^a YALE UNIVERSITY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Additive combinatorics; Cardinality inequalities; Entropy inequalities; Sumsets

Indexed keywords

EID: 84860899256     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20385     Document Type: Article

References (34)

1. P. Balister, B. Bollobás, Projections, entropy, and sumsets. arXiv:0711.1151v1 [math.CO], October 2007.
2. S. Bobkov, M. Madiman, Reverse Brunn-Minkowski and reverse entropy power inequalities for convex measures, J Funct Anal, to appear.
3. S. Bobkov, M. Madiman, Dimensional behaviour of entropy and information, C R Acad Sci Paris Sér I Math 349 (2011), 201-204.
4. B. Bollobás, I. Leader, Compressions and isoperimetric inequalities, J Combinatorial Theory Ser A 56 (1991), 47-62.
5. B. Bollobás, A. Thomason, Projections of bodies and hereditary properties of hypergraphs, Bull London Math Soc 27 (1995), 417-424.
6. F. Chung, R. Graham, P. Frankl, J. Shearer, Some intersection theorems for ordered sets and graphs, J Combinatorial Theory Ser A 43 (1986), 23-37.
7. T. Cover, J. Thomas, Elements of information theory, J. Wiley, New York, 1991.
8. E. Friedgut, Hypergraphs, entropy, and inequalities, The American Mathematical Monthly 111 (2004), 749-760.
9. S. Fujishige, Polymatroidal dependence structure of a set of random variables, Information Control 39 (1978), 55-72.
10. A. Geroldinger, I. Z. Ruzsa, Combinatorial number theory and additive group theory, Advanced Courses in Mathematics, CRM Barcelona, Birkhäuser Verlag, Basel, 2009. Courses and seminars from the DocCourse in Combinatorics and Geometry held in Barcelona, 2008.
11. K. Gyarmati, M. Matolcsi, I. Z. Ruzsa, A superadditivity and submultiplicativity property for cardinalities of sumsets, Combinatorica 30 (2010), 163-174.
12. K. Gyarmati, M. Matolcsi, I. Z. Ruzsa, Plünnecke's inequality for different summands, Building bridges, volume 19 of Bolyai Soc. Math. Stud., M. Grötschel, G. O. H. Katona (Editors), Springer, Berlin, 2008, pp. 309-320.
13. T. S. Han, Nonnegative entropy measures of multivariate symmetric correlations, Information Control 36 (1978), 133-156.
14. V. A. Kaǐmanovich, A. M. Vershik, Random walks on discrete groups: boundary and entropy, Ann Probab 11 (1983), 457-490.
15. M. Madiman, On the entropy of sums, Proc. IEEE Inform Theory Workshop, Porto, Portugal, 2008.
16. M. Madiman, Determinant and trace inequalities for sums of positive-definite matrices, Preprint.
17. M. Madiman, A. Barron, Generalized entropy power inequalities and monotonicity properties of information, IEEE Trans Inform Theory 53 (2007), 2317-2329.
18. M. Madiman, A. Marcus, P. Tetali, Information-theoretic inequalities in additive combinatorics, Proc IEEE Inform Theory Workshop, Cairo, Egypt, January 2010.
19. M. Madiman, P. Tetali, Sandwich bounds for joint entropy, Proceedings of the IEEE International Symposium on Information Theory, Nice, June 2007.
20. M. Madiman, I. Kontoyiannis, The entropies of the sum and the difference of two IID random variables are not too different, Proc. IEEE Intl. Symp. Inform. Theory, Austin, TX, June 2010.
21. M. Madiman, P. Tetali, Information inequalities for joint distributions, with interpretations and applications, IEEE Trans Inform Theory 56 (2010), 2699-2713.
22. F. Matús, Two constructions on limits of entropy functions, IEEE Trans Inform Theory 53 (2007), 320-330.
23. M. Nathanson, Additive number theory: inverse problems and geometry of sumsets, ser. Graduate Texts in Mathematics, Vol. 165, Springer, 1996.
24. G. Petridis, New proofs of Plünnecke-type estimates for product sets in groups. Preprint, Available at:.
25. H. Plünnecke, Eine zahlentheoretische Anwendung der Graphentheorie, J Reine Angew Math 243 (1970), 171-183.
26. J. Radhakrishnan, Entropy and counting, In J. C. Misra, editor, Computational mathematics, modelling and algorithms, Narosa, 2003. Available at:.
27. I. Z. Ruzsa, An application of graph theory to additive number theory, Scientia Ser A Math Sci (N.S.) 3 (1989), 97-109.
28. I. Z. Ruzsa, Addendum to: An application of graph theory to additive number theory, Scientia Ser A Math Sci (N.S.) 4 (1990/91), 93-94.
29. I. Z. Ruzsa, Cardinality questions about sumsets, in Additive combinatorics, ser. CRM, Proc. Lecture Notes, Amer. Math. Soc., Vol. 43, Providence, RI, 2007, pp. 195-205.
30. I. Z. Ruzsa, Sumsets and entropy, Random Struct Algorithms 34 (2009), 1-10.
31. T. Tao, An entropy Plünnecke-Ruzsa inequality. Available at:.
32. T. Tao, Sumset and inverse sumset theory for Shannon entropy, Comb Probab Comput 19 (2010), 603-639.
33. T. Tao, V. Vu, Entropy methods, Unpublished note. 2006. Available at:.
34. T. Tao, V. Vu, Additive Combinatorics, Cambridge Studies in Advanced Mathematics 105, CUP, 2006.