{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T16:06:52Z","timestamp":1770221212307,"version":"3.49.0"},"reference-count":39,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:00:00Z","timestamp":1769990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"ERC","award":["ERMiD"],"award-info":[{"award-number":["ERMiD"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>The entropic region is formed by the collection of the Shannon entropies of all subvectors of finitely many jointly distributed discrete random variables. For four or more variables, the structure of the entropic region is mostly unknown. We utilize a variant of the Maximum Entropy Method to obtain five-variable non-Shannon entropy inequalities, which delimit the five-variable entropy region. This method adds copies of some of the random variables in generations. A significant reduction in computational complexity, achieved through theoretical considerations and by harnessing the inherent symmetries, allowed us to calculate all five-variable non-Shannon inequalities provided by the first nine generations. Based on the results, we define two infinite collections of such inequalities and prove them to be entropy inequalities. We investigate downward-closed subsets of non-negative lattice points that parameterize these collections, and based on this, we develop an algorithm to enumerate all extremal inequalities. The discovered set of entropy inequalities is conjectured to characterize the applied method completely.<\/jats:p>","DOI":"10.3390\/computation14020042","type":"journal-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T16:12:37Z","timestamp":1770048757000},"page":"42","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Information Inequalities for Five Random Variables"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7530-8307","authenticated-orcid":false,"given":"Laszlo","family":"Csirmaz","sequence":"first","affiliation":[{"name":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics, 1053 Budapest, Hungary"},{"name":"Institute of Information Theory and Automation, CZ-182 00 Prague, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2449-7923","authenticated-orcid":false,"given":"Elod P.","family":"Csirmaz","sequence":"additional","affiliation":[{"name":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics, 1053 Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,2,2]]},"reference":[{"key":"ref_1","unstructured":"Csisz\u00e1r, I., and K\u00f6rner, J. (1981). Information Theory: Coding Theorems of Discrete Memoryless Systems, Akademia Kiado."},{"key":"ref_2","unstructured":"Yeung, R.W. (2008). Information Theory and Network Coding, Springer."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","article-title":"Secret-sharing schemes: A survey","volume":"Volume 6639","author":"Beimel","year":"2011","journal-title":"Coding and Cryptology"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"5634","DOI":"10.1109\/TIT.2011.2162183","article-title":"Secret Sharing and Non-Shannon Information Inequalities","volume":"57","author":"Beimel","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"G\u00fcrp\u0131nar, E., and Romashchenko, A. (2019, January 8\u201312). How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Paris, France.","DOI":"10.1109\/ISIT.2019.8849309"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10623-020-00811-1","article-title":"Common information, matroid representation, and secret sharing for matroid ports","volume":"89","author":"Bamiloshin","year":"2021","journal-title":"Des. Codes Cryptogr."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"P2.58","DOI":"10.37236\/9851","article-title":"Guessing Numbers and Extremal Graph Theory","volume":"29","author":"Martin","year":"2022","journal-title":"Electron. J. Comb."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/s00145-013-9152-y","article-title":"Cryptography in the Multi-string Model","volume":"27","author":"Groth","year":"2014","journal-title":"J. Cryptol."},{"key":"ref_9","unstructured":"Madiman, M., Marcus, A.W., and Tetali, P. (September, January 30). Information-theoretic inequalities in additive combinatorics. Proceedings of the IEEE Information Theory Workshop, Dublin, Ireland."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"7030","DOI":"10.1109\/TIT.2021.3104250","article-title":"Conditional independence structures over four discrete random variables revisited","volume":"67","author":"Sudeny","year":"2021","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Yeung, R.W. (2002). A First Course in Information Theory, Kluwer Academic\/Plenum Publishers.","DOI":"10.1007\/978-1-4419-8608-5"},{"key":"ref_12","unstructured":"Pippenger, N. (1986). What are the laws of information theory. 1986 Special Problems on Communication and Computation Conference, Proceedings of the Tenth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, Prague, Czech Republic, 7\u201311 July 1986, Springer."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1109\/18.681320","article-title":"On characterization of entropy function via information inequalities","volume":"44","author":"Zhang","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_14","unstructured":"Dougherty, R., Freiling, C., and Zeger, K. (2011). Non-Shannon information inequalities in four random variables. arXiv."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"6811","DOI":"10.1109\/TIT.2014.2352273","article-title":"Book inequalities","volume":"60","author":"Csirmaz","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Mat\u00fa\u0161, F. (2007, January 24\u201329). Infinitely many information inequalities. Proceedings of the 2007 IEEE International Symposium on Information Theory, Nice, France.","DOI":"10.1109\/ISIT.2007.4557201"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00535682","article-title":"Bounds on conditional probabilities with applications in multi-use communication","volume":"34","author":"Ahlswede","year":"1976","journal-title":"Z. Wahrscheinlichkeitstheorie Verwandte Geb."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"147","DOI":"10.4310\/CIS.2002.v2.n2.a3","article-title":"A new class of non-Shannon-type inequalities for entropies","volume":"2","author":"Makarychev","year":"2002","journal-title":"Commun. Inf. Syst."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Kaced, T. (2013, January 7\u201312). Equivalence of two proof techniques for non-Shannon-type inequalities. Proceedings of the IEEE International Symposium on Information Theory, Istanbul, Turkey.","DOI":"10.1109\/ISIT.2013.6620223"},{"key":"ref_20","unstructured":"Csirmaz, L. (2025). Exploring the entropic region. arXiv."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BF03023004","article-title":"The principle of maximum entropy","volume":"7","author":"Guiasu","year":"1985","journal-title":"Math. Intell."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1487","DOI":"10.1080\/02331934.2020.1737692","article-title":"Inner approximation algorithm for solving linear multiobjective optimization problems","volume":"70","author":"Csirmaz","year":"2020","journal-title":"Optimization"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"6007","DOI":"10.1109\/TIT.2016.2601598","article-title":"Entropy region and convolution","volume":"62","author":"Csirmaz","year":"2016","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1017\/S0963548300001644","article-title":"Conditional Independences among Four Random Variables I","volume":"4","year":"1995","journal-title":"Comb. Probab. Comput."},{"key":"ref_25","unstructured":"Studeny, M., Bouckaert, R.R., and Kocka, T. (2000). Extreme Supermodular Set Functions over Five Variables, Institute of Information Theory and Automation. Research Report N. 1977."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1186\/s40537-019-0178-3","article-title":"A survey on data storage and placement methodologies for Cloud-Big Data ecosystem","volume":"6","author":"Mazumdar","year":"2019","journal-title":"J. Big Data"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1186\/s41937-024-00131-4","article-title":"An introduction to causal discovery","volume":"160","author":"Huber","year":"2024","journal-title":"Swiss J. Econ. Stat."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Ziegler, G.M. (1994). Lectures on Polytopes, Springer.","DOI":"10.1007\/978-1-4613-8431-1"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2464","DOI":"10.1016\/j.disc.2006.11.013","article-title":"Adhesivity of polymatroids","volume":"307","year":"2007","journal-title":"Discret. Math."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1093\/qmathj\/haaa001","article-title":"Effective Versions of Two Theorems of Rado","volume":"71","author":"Bell","year":"2020","journal-title":"Q. J. Math."},{"key":"ref_31","unstructured":"Dougherty, R., Freiling, C., and Zeger, K. (2010). Linear rank inequalities on five or more variables. arXiv."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Boyd, S., and Vandenberghe, L. (2004). Convex Optimization, Cambridge University Press.","DOI":"10.1017\/CBO9780511804441"},{"key":"ref_33","first-page":"886","article-title":"One-adhesive polymatroids","volume":"56","author":"Csirmaz","year":"2020","journal-title":"Kybernetika"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/TIT.2006.887090","article-title":"Two constructions on limits of entropy functions","volume":"53","year":"2007","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"3261","DOI":"10.1109\/TIT.2003.820037","article-title":"Balanced information inequalities","volume":"49","author":"Chan","year":"2003","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Csirmaz, E.P., and Csirmaz, L. (2024). Enumerating Extremal Submodular Functions for n = 6. Mathematics, 13.","DOI":"10.3390\/math13010097"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/s10898-011-9709-y","article-title":"A dual variant of Benson\u2019s \u2018outer approximation algorithm\u2019 for multiple objective linear programming","volume":"52","author":"Ehrgott","year":"2012","journal-title":"J. Glob. Optim."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/j.ejor.2016.02.039","article-title":"The vector linear program solver Bensolve\u2014notes on theoretical background","volume":"260","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"ref_39","unstructured":"OEIS Foundation Inc. (2019). The On-Line Encyclopedia of Integer Sequences, OEIS Foundation Inc.. Available online: https:\/\/oeis.org\/A103116."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/14\/2\/42\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T05:18:21Z","timestamp":1770182301000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/14\/2\/42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,2]]},"references-count":39,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["computation14020042"],"URL":"https:\/\/doi.org\/10.3390\/computation14020042","relation":{},"ISSN":["2079-3197"],"issn-type":[{"value":"2079-3197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,2]]}}}