New inequalities for subspace arrangements

DOI10.1016/j.jcta.2009.10.014zbMath1225.05062arXiv0905.1519OpenAlexW2164554299MaRDI QIDQ616446

Ryan Kinser

Publication date: 7 January 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.1519

zbMATH Keywords

realizablematroidsrank functionspolymatroidssubspace arrangements

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial aspects of finite geometries (05B25)

Related Items (10)

Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Obstructions to determinantal representability ⋮ Coordination and discoordination in linear algebra, linear information theory, and coded caching ⋮ Undecidability of \(c\)-arrangement matroid representations ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ Recent progresses in characterising information inequalities ⋮ On powers of Plücker coordinates and representability of arithmetic matroids ⋮ Excluded minors for matroids satisfying Kinser's inequalities ⋮ Introduction to Secret-Sharing ⋮ Matroid Theory for Algebraic Geometers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequalities for Shannon entropy and Kolmogorov complexity
• On characterization of entropy function via information inequalities
• The Minimal Set of Ingleton Inequalities

This page was built for publication: New inequalities for subspace arrangements