Journal article
New inequalities for subspace arrangements
Journal of Combinatorial Theory. Series A, Vol.118(1), pp.152-161
05/10/2009
DOI: 10.1016/j.jcta.2009.10.014
Abstract
J. Combin. Theory Ser. A, 2010 For each positive integer $n \geq 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 necessary conditions for a (poly)matroid to be realizable. Some related open questions about the "cone of realizable polymatroids" are also presented.
Details
- Title: Subtitle
- New inequalities for subspace arrangements
- Creators
- Ryan Kinser
- Resource Type
- Journal article
- Publication Details
- Journal of Combinatorial Theory. Series A, Vol.118(1), pp.152-161
- DOI
- 10.1016/j.jcta.2009.10.014
- ISSN
- 0097-3165
- eISSN
- 1096-0899
- Language
- English
- Date published
- 05/10/2009
- Academic Unit
- Mathematics
- Record Identifier
- 9983986094802771
Metrics
27 Record Views