Adhesivity of polymatroids
DOI10.1016/j.disc.2006.11.013zbMath1125.05027OpenAlexW1970704552MaRDI QIDQ2455572
Publication date: 25 October 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.11.013
matroidgluingentropy functionpolymatroidpastingmodular pairIngleton inequalitynon-Shannon information theoretical inequalityproper amalgamZhang-Yeung inequality
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial aspects of matroids and geometric lattices (05B35) Measures of information, entropy (94A17) Polytopes and polyhedra (52B99) Information theory (general) (94A15)
Related Items (16)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Submodular functions and optimization
- Extreme convex set functions with many nonnegative differences
- Submodular functions and electrical networks
- A class of non-Shannon-type information inequalities and their applications
- On a new non-Shannon type information inequality
- A new class of non-Shannon-type inequalities for entropies
- Two Constructions on Limits of Entropy Functions
- Polymatroidal dependence structure of a set of random variables
- On characterization of entropy function via information inequalities
- Conditional Independences among Four Random Variables I
- Conditions for representability and transversality of matroids
This page was built for publication: Adhesivity of polymatroids