Fetching the paper…
Reading the bibliography…
A natural link between the notions of majorization and strongly Sperner posets is elucidated.
doi:10.1007/BF01171114
E. Sperner, Ein Satz über Untermengen einer endlichen Menge , Math. Z. 27 (1) (1928) 544–548 · 1928
Earlier work this paper cites.
doi:10.1112/jlms/s1-3.2.105
G. H. Hardy, J. E. Littlewood, Notes on the Theory of Series (VIII): An Inequality , J. London Math. Soc. 3 (2) (1928) 105–110 · 1928
Earlier work this paper cites.
R. M. Gabriel, The rearrangement of positive Fourier coefficients, Proceedings of the London Mathematical Society 2 (1) (1932) 32–51
1932
Earlier work this paper cites.
J. E. Littlewood, A. C. Offord, On the number of real roots of a random algebraic equation. III, Rec. Math. [Mat. Sbornik] N.S. 12(54) (1943) 277–286
1943
Earlier work this paper cites.
P. Erdös, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. 51 (1945) 898–902
1945
Earlier work this paper cites.
doi:10.2307/2304711
P. Erdős, L. Moser, Elementary Problems and Solutions: Solutions: E736 , Amer. Math. Monthly 54 (4) (1947) 229–230 · 1947
Earlier work this paper cites.
C. Shannon, A mathematical theory of communication, Bell System Tech. J. 27 (1948) 379–423, 623–656
1948
Earlier work this paper cites.
G. H. Hardy, J. E. Littlewood, G. Pólya, Inequalities, Cambridge Mathematical Library, Cambridge University Press, Cambridge, 1988, reprint of the 1952 edition
1952
Earlier work this paper cites.
A. Stam, Some inequalities satisfied by the quantities of information of Fisher and Shannon, Information and Control 2 (1959) 101–112
1959
Earlier work this paper cites.
doi:10.4064/aa-11-2-205-208
A. Sárközi, E. Szemerédi, Über ein Problem von Erdős und Moser , Acta Arith. 11 (1965) 205–208 · 1965
Earlier work this paper cites.
G. Katona, On a conjecture of Erdős and a stronger form of Sperner’s theorem, Studia Sci. Math. Hungar 1 (1966) 59–63
1966
Earlier work this paper cites.
W. N. Hsieh, D. J. Kleitman, Normalized matching in direct products of partial orders, Studies in Appl. Math. 52 (1973) 285–289
1973
Earlier work this paper cites.
P. Bergmans, A simple converse for broadcast channels with additive white Gaussian noise, IEEE Trans. Inform. Theory 20 (2) (1974) 279–280
1974
Earlier work this paper cites.
W. Beckner, Inequalities in Fourier analysis, Ann. of Math. (2) 102 (1) (1975) 159–182
1975
Earlier work this paper cites.
E. H. Lieb, Proof of an entropy conjecture of Wehrl, Comm. Math. Phys. 62 (1) (1978) 35–41
1978
Earlier work this paper cites.
doi:10.1137/0601021
R. P. Stanley, Weyl groups, the hard Lefschetz theorem, and the Sperner property , SIAM J. Algebraic Discrete Methods 1 (2) (1980) 168–184 · 1980
Earlier work this paper cites.
doi:10.1016/0012-365X(80)90118-1
R. A. Proctor, M. E. Saks, D. G. Sturtevant, Product partial orders with the Sperner property , Discrete Math. 30 (2) (1980) 173–180 · 1980
Earlier work this paper cites.
doi:10.2307/2975833
R. A. Proctor, Solution of two difficult combinatorial problems with linear algebra , Amer. Math. Monthly 89 (10) (1982) 721–734 · 1982
Earlier work this paper cites.
A. Dembo, T. Cover, J. Thomas, Information-theoretic inequalities, IEEE Trans. Inform. Theory 37 (6) (1991) 1501–1518
1991
Cited alongside, same era.
doi:10.1017/CBO9780511574719
K. Engel, Sperner theory , Vol. 65 of Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge, 1997 · 1997
Cited alongside, same era.
doi:10.1215/S0012-7094-01-10722-9
V. F. Lev, Linear equations over 𝔽 p \mathbb{F}_{p} and moments of exponential sums , Duke Math. J. 107 (2) (2001) 239–263 · 2001
Cited alongside, same era.
J. Radhakrishnan, Entropy and counting , in: IIT Kharagpur Golden Jubilee Volume, 2001. URL http://www.tcs.tifr.res.in/~jaikumar/mypage.html
2001
Cited alongside, same era.
J. Kahn, An entropy approach to the hard-core model on bipartite graphs, Combinatorics, Probability and Computing 10 (2001) 219–237
2001
Cited alongside, same era.
A. D. Barbour, O. Johnson, I. Kontoyiannis, M. Madiman, Compound Poisson approximation via information functionals, Electron. J. Probab. 15 (42) (2010) 1344–1368
2010
Later among the works it cites.
doi:10.1109/TIT.2010.2070570
O. Johnson, Y. Yu, Monotonicity, thinning, and discrete versions of the entropy power inequality , IEEE Trans. Inform. Theory 56 (11) (2010) 5387–5395 · 2010
Later among the works it cites.
O. Johnson, I. Kontoyiannis, M. Madiman, Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures, Discrete Appl. Math. 161 (2013) 1232–1250, dOI: 10.1016/j.dam.2011.08.025
2011
Later among the works it cites.
doi:10.1007/978-0-387-68276-1
A. W. Marshall, I. Olkin, B. C. Arnold, Inequalities: theory of majorization and its applications , 2nd Edition, Springer Series in Statistics, Springer, New York, 2011 · 2011
Later among the works it cites.
doi:10.1016/j.jcta.2012.01.003
H. H. Nguyen, A new approach to an old problem of Erdős and Moser , J. Combin. Theory Ser. A 119 (5) (2012) 977–993 · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. J. Gardner, P. Gronchi, A Brunn-Minkowski inequality for the integer lattice , Trans. Amer. Math. Soc. 353 (10) (2001) 3995–4024 (electronic) · 2001
Cited alongside, same era.
doi:10.1090/S0273-0979-02-00941-2
R. J. Gardner, The Brunn-Minkowski inequality , Bull. Amer. Math. Soc. (N.S.) 39 (3) (2002) 355–405 (electronic) · 2002
Cited alongside, same era.
O. Johnson, Information theory and the central limit theorem, Imperial College Press, London, 2004
2004
Cited alongside, same era.
S. Artstein, K. M. Ball, F. Barthe, A. Naor, Solution of Shannon’s problem on the monotonicity of entropy, J. Amer. Math. Soc. 17 (4) (2004) 975–982 (electronic)
2004
Cited alongside, same era.
I. Kontoyiannis, P. Harremoës, O. Johnson, Entropy and the law of small numbers, IEEE Trans. Inform. Theory 51 (2) (2005) 466–472
2005
Cited alongside, same era.
M. Madiman, Topics in information theory, probability and statistics, Ph.D. thesis, Brown University, Providence RI (August 2005)
2005
Cited alongside, same era.
doi:10.1109/TIT.2006.880064
H. Weingarten, Y. Steinberg, S. Shamai, The capacity region of the Gaussian multiple-input multiple-output broadcast channel , IEEE Trans. Inform. Theory 52 (9) (2006) 3936–3964 · 2006
Cited alongside, same era.
Later among the works it cites.
2012
Later among the works it cites.
R. P. Stanley, Enumerative combinatorics. Volume 1, 2nd Edition, Vol. 49 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, 2012
2012
Later among the works it cites.
doi:10.1017/S0963548312000478
B. Morris, Improved mixing time bounds for the Thorp shuffle , Combin. Probab. Comput. 22 (1) (2013) 118–132 · 2013
Later among the works it cites.
L. Wang, J. O. Woo, M. Madiman, A lower bound on the Rényi entropy of convolutions in the integers, in: Proc. IEEE Intl. Symp. Inform. Theory, Honolulu, Hawaii, 2014, pp. 2829–2833
2014
Later among the works it cites.
2014
Later among the works it cites.
S. Haghighatshoar, E. Abbe, E. Telatar, A new entropy power inequality for integer-valued random variables, IEEE Trans. Inform. Th. 60 (7) (2014) 3787–3796
2014
Later among the works it cites.
J. O. Woo, M. Madiman, A discrete entropy power inequality for uniform distributions, in: Proc. IEEE Intl. Symp. Inform. Theory, Hong Kong, China, 2015
2015
Later among the works it cites.
J. O. Woo, Information theoretic inequalities, limit theorems, and universal compression over unknown alphabets, Ph.D. thesis, Yale University, New Haven (May 2015)
2015
Later among the works it cites.
2017
Closest in time.
doi:10.1109/TIT.2017.2764487
S. G. Bobkov, A. Marsiglietti, Variants of the entropy power inequality , IEEE Trans. Inform. Theory 63 (12) (2017) 7747–7752 · 2017
Closest in time.
2018
Closest in time.
J. Li, Rényi entropy power inequality and a reverse, Studia Math. 242 (2018) 303–319
2018
Closest in time.