The Facets of the Bases Polytope of a Matroid and Two Consequences

Brahim Chaourar

doi:10.4236/ojdm.2018.81002

Open Journal of Discrete Mathematics > Vol.8 No.1, January 2018

The Facets of the Bases Polytope of a Matroid and Two Consequences

Brahim Chaourar
Department of Mathematics and Statistics, Al Imam Mohamed Ibn Saud University (IMSIU), Riyadh, Saudi Arabia.
DOI: 10.4236/ojdm.2018.81002 PDF HTML XML 788 Downloads 1,405 Views Citations

Abstract

Let M be a matroid defined on a finite set E and L ⊂ E . L is locked in M if

and

are 2-connected, and

. In this paper, we prove that the nontrivial facets of the bases polytope of M are described by the locked subsets. We deduce that finding the maximum-weight basis of M is a polynomial time problem for matroids with a polynomial number of locked subsets. This class of matroids is closed under 2-sums and contains the class of uniform matroids, the Vámos matroid and all the excluded minors of 2-sums of uniform matroids. We deduce also a matroid oracle for testing uniformity of matroids after one call of this oracle.

Keywords

Bases Polytope, Facets, Locked Subsets, Maximum-Weight Basis Problem, Polynomially Locked Matroids, Matroid Oracle, Testing Unformity of a Matroid

Share and Cite:

Chaourar, B. (2018) The Facets of the Bases Polytope of a Matroid and Two Consequences. Open Journal of Discrete Mathematics, 8, 14-20. doi: 10.4236/ojdm.2018.81002.

1. Introduction

Sets and their characteristic vectors will not be distinguished. We refer to Oxley [1] and Schrijver [2] about, respectively, matroids and polyhedra terminology and facts.

Let M be a matroid defined on a finite set E. $I (M)$ , $B (M)$ and the function r are, respectively, the class of independent sets, bases and the rank function of M. $M^{*}$ , $B^{*} (M)$ and the function $r^{*}$ are, respectively, the dual matroid, the class of cobases and the dual rank function of M. For any $X \subset E$ , $B (X)$ and $B^{*} (X)$ are, respectively the class of bases of $M | X$ and cobases of $M^{*} | X$ . The polyhedra $Q (M)$ and $P (M)$ are, respectively, the convex hulls of the independent sets and the bases of M. Suppose that M (and $M^{*}$ ) is 2-connected. A subset $L \subset E$ is called a locked subset of M if $M | L$ and $M^{*} | (E \ L)$ are 2-connected, and their corresponding ranks are at least 2, i.e., $\min {r (L), r^{*} (E \ L)} \geq 2$ . It is not difficult to see that if L is locked then both L and $E \ L$ are closed, respectively, in M and $M^{*}$ (That is why we call it locked). We denote by $L (M)$ and $l (M)$ , respectively, the class of locked subsets of M and its cardinality, which is called the locked number of M. Given a positive integer k (k does not depend on M or $| E |$ ), the class of k-locked matroids, denoted by $L_{k}$ , is the class of matroids M such that $l (M) \in O ({| E |}^{k})$ . $L_{0}$ is the class of matroids M such that $L (M) = \emptyset$ , i.e., $l (M) = 0$ . For a given nonegative integer k, $L_{k}$ is called also a polynomially locked class of matroids and its members are called k-locked or polynomially locked matroids. It is not difficult to see that the class of lockeds subsets of a matroid M is the union of lockeds subsets of the 2-connected components of M. The locked structure of M is the quadruple ( $P (M)$ , $S (M)$ , $L (M)$ , $ρ$ ), where $P (M)$ and $S (M)$ are, respectively, the class of parallel and coparallel closures, and $ρ$ is the rank function restricted to $P (M) \cup S (M) \cup L (M) \cup {\emptyset, E}$ .

Given a weight function $c \in R^{E}$ , the maximum-weight basis problem (MWBP) is the following optimization problem:

Maximize{ $c (B)$ such that $B \in B (M)$ }

The corresponding maximum-weight independent problem is clearly (polynomially time) equivalent to MWBP. MWBP is polynomial on $| E |$ and $θ$ , where $θ$ is the complexity of the used matroid oracle [3] . Even if we use the approach introduced by Mayhew [4] by giving the list of bases (for example) in the input, MWBP is polynomial on the size of the input. However, as Robinson and Welsh [5] note, no matter which of the ways to specify a matroid, the size of the input for a matroid problem on an n-element set is $O (2^{n})$ . It follows that MWBP is not polynomial in its strict sense, that is on $| E |$ . We prove that MWBP is polynomial on $| E |$ for polynomially locked classes of matroids, i.e., for any matroid $M \in L_{k}$ (for a fixed k). This class of polynomially locked matroids is closed under 2-sums and contains the class of uniform matroids, the Vámos matroid and all the excluded minors of 2-sums of uniform matroids. These excluded minors are $M (K_{4})$ , $W^{3}$ , $Q_{6}$ and $P_{6}$ [6] . It follows that this class is larger than 2-sums of uniform matroids.

Testing Uniformity of matroids (TUM) is to provide an algorithm in which the matroid is represented by an oracle and which decides whether the given matroid is uniform or not after a number of calls on the oracle which is bounded by a polynomial in the size of the ground set. Jensen and Korte [7] proved that there exists no such algorithm in which the matroid is represented by an independence test oracle (or an oracle polynomially related to an independence test oracle). In this paper, we give a matroid oracle which answers this question.

The remainder of the paper is organized as follows: in Section 2, we give all facets of the bases polytope, then, in Section 3, we deduce two consequences of this characterization. The first one is that MWBP is polynomial (time) for polynomially locked classes of matroids, and the second one is a polynomial time algorithm via a new matroid oracle for testing if a given matroid is uniform or not. In Section 4, we describe some polynomially locked classes of matroids, and we conclude in Section 5.

2. Facets of the Bases Polytope

A description of $Q (M)$ was given by Edmonds [3] as follows.

Theorem 2.1. $Q (M)$ is the set of all $x \in R^{E}$ such that

$x (e) \geq 0 for any e \in E$ (1)

$x (A) \leq r (A) for any A \subseteq E$ (2)

Later, a minimal description of $Q (M)$ was given also by Edmonds [8] as follows.

Theorem 2.2. The inequality (2) is a facet of $Q (M)$ if and only if A is closed and 2-connected.

It is not difficult to see that $P (M)$ is the set of all $x \in R^{E}$ satisfying the inequalities (1), (2) and

$x (E) = r (E)$ (3)

It seems natural to think that the inequality (2) is a facet of $P (M)$ if and only if A is closed and 2-connected. This is not true because:

Lemma 2.3. If the inequality (2) is a facet of $P (M)$ then A is a locked subset of M.

Proof. It suffices to prove that if X is closed and 2-connected but $E \ L$ is not 2-connected in the dual then the inequality (2) is not a facet. In fact, there exist A and B two disjoint subsets of E such that $E \ X = A \cup B$ and $r^{*} (E \ X) = r^{*} (A) + r^{*} (B)$ , that is, $| E \ X | - r (E) + r (X) = | A | - r (E) + r (E \ A)$ $+ | B | - r (E) + r (E \ B)$ . It follows that: $r (E) + r (X) = r (E \ A) + r (E \ B) \geq$ $x (E \ A) + x (E \ B) = x (E) + x (X)$ , which implies the inequality (2). So the inequality (2) is redundant and cannot be a facet. ,

We give now a minimal description of $P (M)$ . A part of the proof is inspired from a proof given by Pulleyblank [9] to describe the nontrivial facets of $Q (M)$ . Independently, Fujishige [10] , and Feichtner and Sturmfels [11] , gave a characterization of nontrivial facets of $P (M)$ . We give here below a new and complete formulation with a new proof.

Theorem 2.4. A minimal description of $P (M)$ is the set of all $x \in R^{E}$ satisfying the equality (3) and the following inequalities:

$x (P) \leq 1 for any parallel closure P \subseteq E$ (4)

$x (S) \geq | S | - 1 for any coparallel closure S \subseteq E$ (5)

$x (L) \leq r (L) for any locked subset L \subseteq E$ (6)

Proof. Without loss of generality, we can suppose that M is without parallel or coparallel elements so the inequalities (5) become as (1) and the inequalities (4) become the following:

$x (e) \leq 1 for any e \in E$ (7)

Let $C (M)$ be the cone generated by the incidence vectors of the bases of M. It suffices to prove that the minimal description of $C (M)$ is given by (1) and the following inequalities:

$x (e) \leq x (E) / r (E) for any e \in E$ (8)

$x (L) / r (L) \leq x (E) / r (E) for any locked subset L \subseteq E$ (9)

It is not difficult to see via induction and operations of deletion and contraction that the inequalities (1) and (8) are facets of $C (M)$ . It remains to prove that the inequality (9) is a facet of $C (M)$ if and only if L is a locked subset of M. According to Lemma 2.3, it suffices to prove the inverse way. Note that (9) is equivalent to the following inequality:

$(r (L) - r (E)) x (L) + r (L) x (E \ L) \geq 0 for any locked subset L \subseteq E$ (10)

Let $a x \geq 0$ be a valid inequality for $C (M)$ which is tight for all $B \in B (L)$ .

Claim 1: $a_{j} = a_{k}$ for all j and k of L.

Suppose this is not true. Let $X = {j \in L such that a_{j} takes minimum over L}$ , $Y = L \ X$ and $B \in B (L) \cap B (Y)$ . Since L is 2-connected in M, and since, by assumption, X is a strict subset of L, then $r (X) > | B \cap X |$ . Thus there exists $e \in X \ B$ such that $(B \cap X) \cup e$ is an independent set of M. It follows that there exists $f \in B \cap Y$ such that $\tilde{B} = (B \ f) \cup e \in B (L)$ . But: $a (\tilde{B}) = a (B)$ $- a (f) + a (e) < a (B)$ , a contradiction.

Claim 2: For any $X \subseteq E$ , $B \in B (X)$ if and only if $E \ B \in B^{*} (E \ X)$ .

It suffices to prove one way and use duality for the other way.

Let $B \in B (X)$ then

$\begin{matrix} | B \cap X | = r (X) = | X | - r^{*} (E) + r^{*} (E \ X) \\ = | E | - | E \ X | - r^{*} (E) + r^{*} (E \ X) \\ = r (E) - | E \ X | + r^{*} (E \ X) . \end{matrix}$

Thus,

$\begin{matrix} | (E \ B) \cap (E \ X) | = | E \ X | - | B \cap (E \ X) | \\ = | E \ X | - | B | + | B \cap X | \\ = | E \ X | - | B | + r (E) - | E \ X | + r^{*} (E \ X) \\ = r^{*} (E \ X) . \end{matrix}$

Since $E \ B$ is a basis in the dual, then $E \ B \in B^{*} (E \ X)$ .

Claim 3: $a_{j} = a_{k}$ for all j and k of $E \ L$ .

Using claim 2, $E \ L$ being 2-connected and a similar argument on $E \ B$ as in claim 1, we conclude.

Claim 4: $a x \geq 0$ is a multiple of inequality (10).

By claims 1 and 3, $a x \geq 0$ becomes: $a_{L} x (L) + a_{E \ L} x (E \ L) \geq 0$ . Thus, for $B \in B (L)$ , we have:

$a_{L} | B \cap L | + a_{E \ L} | B \cap (E \ L) | = 0,$

that is,

$a_{L} r (L) + a_{E \ L} (r (E) r (L)) = 0.$

But $a_{L} = r (L) r (E)$ and $a_{E \ L} = r (L)$ is a solution of this equation, so we conclude. ,

3. MWBP and TUM

Since the bases polytope is completly described by the locked structure of the matroid, so a natural matroid oracle follows.

The k-locked oracle

Input: a nonegative integer k and a matroid M defined on E.

Output: 1) No if $M \notin L_{k}$ , and

2) ( $P (M)$ , $S (M)$ , $L (M)$ , $ρ$ ) if $M \in L_{k}$ .

Note that this oracle has time complexity $O ({| E |}^{k + 1})$ because we need to count at most ${| E |}^{k + 1}$ members of $L (M)$ in order to know that M is not k-locked, even if the memory complexity can be $O (| E | + l (M))$ . Actually this matroid oracle permits to recognize if a given matroid is k-locked or not for a given nonegative integer k (which does not depend on M or $| E |$ ).

The first consequence of Theorem 2.4 then follows.

Corollary 3.1. Given a nonegative integer k, a matroid $M \in L_{k}$ , the k-locked oracle to acess M and a weight function $c \in R^{E}$ . Then there exists a polynomial time algorithm on the size of $E (M)$ for solving MWBP in M.

Proof. Let M be a such matroid. Since $M \in L_{k}$ then it can be described by its locked structure in the input of MWBP by using the k-locked oracle. MWBP is equivalent for optimizing on $P (M)$ , which is also equivalent to separating on $P (M)$ . Since the number of facets of $P (M)$ is $2 | E | + l (M)$ then separating can be done on $O (| E | + l (M))$ . But M is polynomially locked, hence $l (M) \in$ $O ({| E |}^{k})$ and separating on $P (M)$ can be done on $O ({| E |}^{k})$ . ,

The k-locked oracle is stronger than the rank and the independence oracles for polynomially locked matroids:

We can get the rank of any subset $X \subseteq E$ by choosing the weight function c equal to the characteristic vector of X and optimizing on $P (M)$ , which can be done in polynomial time. The obtained optimum value of c is the requested rank.

For the independence oracle, we can decide if a subset $X \subseteq E$ is independent or not by choosing the same previous weight function and decide that X is independent if it is included in the optimum basis, and not independent otherwise.

For testing uniformity of matroids, we need the following result [6] .

Theorem 3.2. A 3-connected matroid M is uniform if and only if $l (M) = 0$ .

We can see through the proof of this theorem that $l (M) = 0$ if M is uniform whatever its connectivity. For disconnected matroids, we have the following result [1] .

Theorem 3.3. A disconnected matroid M is uniform if and only if $r (M) = | E |$ or $r (M) = 0$ .

For 2-connected matroids, we can write:

Proposition 3.4. A 2-connected matroid M is uniform if and only if one of the following properties holds:

i) $l (M) = 0$ and $| P (M) | = | E | = | S (M) |$ ;

ii) $| P (M) | = 1$ ;

iii) $| S (M) | = 1$ .

So we can now characterize uniform matroids as follows.

Corollary 3.5. M is uniform if and only if one of the following properties holds:

i) $l (M) = 0$ and $| P (M) | = | E | = | S (M) |$ ;

ii) $| P (M) | = 1$ ;

iii) $| S (M) | = 1$ ;

iv) $r (M) = | E |$ ;

v) $r (M) = 0$ .

A natural matroid oracle follows.

The locked number oracle

Input: a matroid M defined on E.

Output: $l (M)$ , $r (M)$ , $| P (M) |$ , $| S (M) |$ .

Note that, except for $l (M)$ , all other outputs of this oracle can be computed in a polynomial time given a locked structure of M. We can now give an algorithm which tests if a given matroid is uniform after one call of the locked number oracle.

Testing Uniformity of Matroids

Input: a matroid M defined on E.

Output: a) M is uniform if one of the following properties holds:

i) $l (M) = 0$ and $| P (M) | = | E | = | S (M) |$ ;

ii) $| P (M) | = 1$ ;

iii) $| S (M) | = 1$ ;

iv) $r (M) = | E |$ ;

v) $r (M) = 0$ .

b) Else, M is not uniform.

4. Some Polynomially Locked Matroids

Since 2-sums preserve k-lockdness for $k \geq 1$ [12] , $l (M (K_{4})) = 4$ , $l (W^{3}) = 3$ , $l (Q_{6}) = 2$ , $l (P_{6}) = 1$ , $l (V_{8}) = 5$ , then we can say:

Theorem 4.1. If $k \geq 1$ then $L_{k}$ is closed under 2-sums, contains all the excluded minors of 2-sums of uniform matroids and the Vámos matroid.

In particular, $L_{1}$ is closed under 2-sums and contains all the above matroids.

It follows that $L_{1}$ contains strictly 2-sums of uniform matroids.

5. Conclusion

We have given a complete description of all facets of the bases polytope of a matroid and deduce two consequences. One about MWBP and the second about TUM. Future investigations can be characterizing some or all polynomially locked classes of matroids.

Acknowledgements

The author is grateful to anonymous referees in a previous version of this paper.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	Oxley, J.G. (1992) Matroid Theory. Oxford University Press, Oxford.
[2]	Schrijver, A. (1986) Theory of Linear and Integer Programming. John Wiley and Sons, Chichester.
[3]	Edmonds, J. (1971) Matroids and the Greedy Algorithm. Mathematical Programming, 1, 127-136. https://doi.org/10.1007/BF01584082
[4]	Mayhew, D. (2008) Matroid Complexity and Nonsuccinct Descriptions. SIAM Journal on Discrete Mathematics, 22, 455466. https://doi.org/10.1137/050640576
[5]	Robinson, G.C. and Welsh, D.J.A. (1980) The Computational Complexity of Matroid Properties. Mathematical Proceedings of the Cambridge Philosophical Society, 87, 29-45. https://doi.org/10.1017/S0305004100056498
[6]	Chaourar, B. (2011) A Characterization of Uniform Matroids. ISRN Algebra, 2011, Article ID: 208478. https://doi.org/10.5402/2011/208478
[7]	Jensen, P.M. and Korte, B. (1982) Complexity of Matroid Property Algorithms. SIAM Journal on Computing, 11, 184-190. https://doi.org/10.1137/0211014
[8]	Giles, R. (1975) Submodular Functions, Graphs and Integer Polyhedra. PhD Thesis, University of Waterloo, Waterloo.
[9]	Pulleyblank, W.R. (1989) Polyhedral Combinatorics. In: Nemhauser, G.L., et al., Eds., Handbooks in Operations Research and Management Science, Elsevier, Amsterdam, 371-446.
[10]	Fujishige, S. (1984) A Characterization of Faces of the Base Polyhedron Associated with a Sub Modular System. Journal of the Operations Research Society of Japan, 27, 112-128. https://doi.org/10.15807/jorsj.27.112
[11]	Feichtner, E.M. and Sturmfels, B. (2005) Matroid Polytopes, Nested Sets and Bergman Fans. Portugaliae Mathematica, 62, 437-468.
[12]	Chaourar, B. (2008) On the Kth Best Basis of a Matroid. Operations Research Letters, 36, 239-242. https://doi.org/10.1016/j.orl.2007.05.007

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies