One-adhesive polymatroids
From MaRDI portal
Publication:5858540
DOI10.14736/kyb-2020-5-0886OpenAlexW3110854315MaRDI QIDQ5858540
Publication date: 13 April 2021
Published in: Kybernetika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.07565
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial aspects of matroids and geometric lattices (05B35) Information theory (general) (94A15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the sticky matroid conjecture
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- On secret-sharing matroids
- Adhesivity of polymatroids
- Entropy Region and Convolution
- Two Constructions on Limits of Entropy Functions
- Polymatroidal dependence structure of a set of random variables
- PROBABILISTIC CONDITIONAL INDEPENDENCE STRUCTURES AND MATROID THEORY: BACKGROUND1
- Lectures on Polytopes
- Network information flow
- Conditional Independences among Four Random Variables I
This page was built for publication: One-adhesive polymatroids