New inequalities for subspace arrangements

作者：Kinser Ryan^*

来源：Journal of Combinatorial Theory - Series A, 2011, 118(1): 152-161.

DOI：10.1016/j.jcta.2009.10.014

• Matroids
• Polymatroids
• Realizable
• Subspace arrangements
• Rank functions

For each positive integer n >= 4 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

• 出版日期2011-1