THE CRITICAL PROBLEM FOR POLYMATROIDS
THE CRITICAL PROBLEM FOR POLYMATROIDS
复制标题
多形体的关键问题
DOI:
10.1093/qmath/45.1.117
复制
发表时间:
1994
影响因子:
0.7
通讯作者:
G. Whittle
中科院分区:
文献类型:
--
作者:
G. Whittle
LET 5 be a collection of subspaces of V (r, q), the rank-r vector space over GF (q). Of the subspaces of V (r, q) which contain no member of 5, let U be one with maximum rank. What is the rank of Ul In the special case that the subspaces in U all have rank less than or equal to 1, the above problem is well-studied. It is, in essence, the critical problem for matroids developed by Crapo and Rota [2]. There it is shown that the rank of U depends only on the matroid structure of 5 and that it is determined by an evaluation of the characteristic polynomial of this matroid. In this paper we show that a similar result holds in the more general case. In this case, the rank of U depends only on the poly matroid structure of U and is determined by an evaluation of the characteristic polynomial of this polymatroid.The main results, presented in Section 3, are direct polymatroidtheoretic generalisations of the standard matroid-theoretic ones. With some polymatroid-theoretic preliminaries, established in Section 2, the proofs are very simple. Given this, the material in this paper perhaps needs some justification and the remainder of this introduction is devoted to this.