New inequalities for subspace arrangements

DOI10.1016/J.JCTA.2009.10.014zbMATH Open1225.05062arXiv0905.1519OpenAlexW2164554299MaRDI QIDQ616446FDOQ616446

Authors: Ryan Kinser 

Publication date: 7 January 2011

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

Abstract: For each positive integer $ngeq4$, we give an inequality satisfied by rank functions of arrangements of $n$ subspaces. When $n=4$ we recover Ingleton's inequality; for higher $n$ the inequalities are all new. These inequalities can be thought of as a hierarchy of necessary conditions for a (poly)matroid to be realizable. Some related open questions about the "cone of realizable polymatroids" are also presented.

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

Recommendations

• An inequality for polymatroid functions and its applications.
• Some inequalities for Whitney-Tutte polynomials
• Excluded minors for matroids satisfying Kinser's inequalities
• Conditional Independences among Four Random Variables I
• On group violations of inequalities in five subgroups

zbMATH Keywords

matroidsrank functionsrealizablesubspace arrangementspolymatroids

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On characterization of entropy function via information inequalities
• Title not available (Why is that?)
• Inequalities for Shannon entropy and Kolmogorov complexity
• Title not available (Why is that?)
• The Minimal Set of Ingleton Inequalities

Cited In (10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616446)