Adhesivity of polymatroids

Two polymatroids are adhesive if a polymatroid extends both in such a way that two ground sets become a modular pair. Motivated by entropy functions, the class of polymatroids with adhesive restrictions and a class of selfadhesive polymatroids are introduced and studied. Adhesivity is described by polyhedral cones of rank functions and defining inequalities of the cones are identified, among them known and new non-Shannon type information inequalities for entropy functions. The selfadhesive polymatroids on a four-element set are characterized by Zhang-Yeung inequalities.

[1]  Martin Grötschel,et al.  Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 , 1983, ISMP.

[2]  H. Narayanan.  Submodular functions and electrical networks , 1997 .

[3]  Satoru Fujishige,et al.  Polymatroidal Dependence Structure of a Set of Random Variables , 1978, Inf. Control..

[4]  F. Mat.  Two Constructions on Limits of Entropy Functions , 2007, IEEE Trans. Inf. Theory.

[5]  Milan Studený,et al.  Conditional Independences among Four Random Variables I , 1995, Combinatorics, Probability and Computing.

[6]  Frantisek Matús,et al.  Extreme convex set functions with many nonnegative differences , 1994, Discret. Math..

[7]  Zhen Zhang,et al.  On a new non-Shannon-type information inequality , 2002, Proceedings IEEE International Symposium on Information Theory,.

[8]  M. Lunelli,et al.  Representation of matroids , 2002, math/0202294.

[9]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[10]  James G. Oxley,et al.  Matroid theory , 1992 .

[11]  Zhen Zhang,et al.  On Characterization of Entropy Function via Information Inequalities , 1998, IEEE Trans. Inf. Theory.

[12]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[13]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[14]  Zhen Zhang,et al.  A class of non-Shannon-type information inequalities and their applications , 2001, Commun. Inf. Syst..

[15]  F. Mattt,et al.  Conditional Independences among Four Random Variables Iii: Final Conclusion , 1999 .

[16]  G. Ziegler.  Lectures on Polytopes , 1994 .

[17]  N. White.  Theory of Matroids , 2008 .

[18]  Raymond W. Yeung,et al.  A First Course in Information Theory (Information Technology: Transmission, Processing and Storage) , 2006 .

[19]  Nikolai K. Vereshchagin,et al.  A new class of non-Shannon-type inequalities for entropies , 2002, Commun. Inf. Syst..

[20]  Frantisek Matús,et al.  Conditional Independences among Four Random Variables II , 1995, Combinatorics, Probability and Computing.

[21]  A. Ingleton,et al.  Conditions for representability and transversality of matroids , 1971 .

[22]  Randall Dougherty,et al.  Six New Non-Shannon Information Inequalities , 2006, 2006 IEEE International Symposium on Information Theory.

[23]  Raymond W. Yeung,et al.  A First Course in Information Theory , 2002 .