Institute of Information Theory and Automation

You are here

Bibliography

Journal Article

Adhesivity of polymatroids

Matúš František

: Discrete Mathematics vol.307, 21 (2007), p. 2464-2477

: CEZ:AV0Z10750506

: IAA100750603, GA AV ČR

: polymatroid, matroid, modular pair, proper amalgam, pasting, entropy function, non-Shannon information theoretical inequality

: http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V00-4MWPSM5-1-1&_cdi=5632&_user=640956&_orig=browse&_coverDate=10%2F06%2F2007&_sk=996929978&view=c&wchp=dGLbVlz-zSkWz&md5=81220a9e434d8fe5a92becb52f5843b5&ie=/sdarticle.pdf

(eng): 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.

(cze): Dva polymatroidy jsou adhesivní, když je nějaký polymtroid rozšiřuje tak, že nosiče jsou v něm modulárním párem. Byly zavedeny a studovány třídy polymatroidů s adhesivními restrikcemi a samoadhesivních polymatroidů. Adhesivita byla popsána pomocí polyhedrálních kuželů. Samoadhesivní polymatroidy na čtyřprvkové množině byly popsány pomocí Zhang-Yeungových nerovností.

: BA

2019-01-07 08:39