Adhesivity of polymatroids

DOI10.1016/j.disc.2006.11.013zbMath1125.05027MaRDI QIDQ2455572

František Matúš

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

zbMATH Keywords

matroid; gluing; entropy function; polymatroid; pasting; modular pair; Ingleton inequality; non-Shannon information theoretical inequality; proper amalgam; Zhang-Yeung inequality

Mathematics Subject Classification ID

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

05B35: Combinatorial aspects of matroids and geometric lattices

94A17: Measures of information, entropy

52B99: Polytopes and polyhedra

94A15: Information theory (general)

Related Items

One-adhesive polymatroids, Secret sharing schemes for ports of matroids of rank 3, Selfadhesivity in Gaussian conditional independence structures, Algebraic matroids are almost entropic, The entropic approach to causal correlations, Optimal complexity of secret sharing schemes with four minimal qualified subsets, On the optimization of bipartite secret sharing schemes, An impossibility result on graph secret sharing, Classes of matroids closed under minors and principal extensions, Finding lower bounds on the complexity of secret sharing schemes by linear programming, Secret sharing and duality, On abelian and homomorphic secret sharing schemes, A note on the connectivity of 2-polymatroid minors, Unavoidable minors for connected 2-polymatroids, A splitter theorem for 3-connected 2-polymatroids, Cyclic flats of a polymatroid

Uses Software

• ITIP

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