Classes of matroids closed under minors and principal extensions
From MaRDI portal
Publication:1786053
DOI10.1007/s00493-017-3534-yzbMath1424.05041OpenAlexW2619991944MaRDI QIDQ1786053
Publication date: 24 September 2018
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-017-3534-y
Combinatorial aspects of matroids and geometric lattices (05B35) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)
Related Items (4)
Algebraic matroids are almost entropic ⋮ On ideal and weakly-ideal access structures ⋮ Bipartite secret sharing and staircases ⋮ Common information, matroid representation, and secret sharing for matroid ports
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ITIP
- Secret-sharing matroids need not be algebraic
- On algebraic matroids
- Some open problems on excluding a uniform matroid
- On excluded minors for real-representability
- Algebraic characteristic sets of matroids
- A class of non-algebraic matroids of rank three
- On secret-sharing matroids
- Matroid representations by partitions
- Almost affine codes
- A generalization of the Ingleton-Main lemma and a class of non-algebraic matroids
- Skew partial fields, multilinear representations of matroids, and a matrix tree theorem
- Dowling geometries representable over rings
- Adhesivity of polymatroids
- Solving Rota's Conjecture
- Matroid Theory for Algebraic Geometers
- Entropy Region and Convolution
- Secret-Sharing Schemes: A Survey
- On secret sharing schemes, matroids and polymatroids
- The Representation Problem for Independence Functions
- Networks, Matroids, and Non-Shannon Information Inequalities
- Two Constructions on Limits of Entropy Functions
- Non‐Algebraic Matroids exist
- Polymatroidal dependence structure of a set of random variables
- PROBABILISTIC CONDITIONAL INDEPENDENCE STRUCTURES AND MATROID THEORY: BACKGROUND1
- A non-Shannon-type conditional inequality of information quantities
- On characterization of entropy function via information inequalities
- Universally ideal secret-sharing schemes
- Multi-linear Secret-Sharing Schemes
This page was built for publication: Classes of matroids closed under minors and principal extensions
