Matroid oracle

Although some authors have experimented with computer representations of matroids that explicitly list all independent sets or all basis sets of the matroid,[4] these representations are not succinct: a matroid with ${\displaystyle \scriptstyle n}$ elements may expand into a representation that takes space exponential in ${\displaystyle \scriptstyle n}$. Indeed, the number of distinct matroids on ${\displaystyle \scriptstyle n}$ elements grows doubly exponentially as

${\displaystyle 2^{2^{n}n^{-3/2+o(1)}}}$[5]

from which it follows that any explicit representation capable of handling all possible matroids would necessarily use exponential space.[6]

Instead, different types of matroids may be represented more efficiently from the other structures from which they are defined: uniform matroids from their two numeric parameters, graphic matroids, bicircular matroids, and gammoids from graphs, linear matroids from matrices, etc. However, an algorithm for performing computations on arbitrary matroids needs a uniform method of accessing its argument, rather than having to be redesigned for each of these matroid classes. The oracle model provides a convenient way of codifying and classifying the kinds of access that an algorithm might need.

Starting with Rado (1942), "independence functions" or "${\displaystyle \scriptstyle I}$-functions" have been studied as one of many equivalent ways of axiomatizing matroids. An independence function maps a set of matroid elements to the number ${\displaystyle \scriptstyle 1}$ if the set is independent or ${\displaystyle \scriptstyle 0}$ if it is dependent; that is, it is the indicator function of the family of independent sets, essentially the same thing as an independence oracle.[7]

Matroid oracles have also been part of the earliest algorithmic work on matroids. Thus, Edmonds (1965), in studying matroid partition problems, assumed that the access to the given matroid was through a subroutine that takes as input an independent set ${\displaystyle \scriptstyle I}$ and an element ${\displaystyle \scriptstyle x}$, and either returns a circuit in ${\displaystyle \scriptstyle I\cup \{x\}}$ (necessarily unique and containing ${\displaystyle \scriptstyle x}$, if it exists) or determines that no such circuit exists. Edmonds (1971) used a subroutine that tests whether a given set is independent (that is, in more modern terminology, an independence oracle), and observed that the information it provides is sufficient to find the minimum weight basis in polynomial time.

Beginning from the work of Korte & Hausmann (1978) and Hausmann & Korte (1978), researchers began studying oracles from the point of view of proving lower bounds on algorithms for matroids and related structures. These two papers by Hausmann and Korte both concerned the problem of finding a maximum cardinality independent set, which is easy for matroids but (as they showed) harder to approximate or compute exactly for more general independence systems represented by an independence oracle. This work kicked off a flurry of papers in the late 1970s and early 1980s showing similar hardness results for problems on matroids[8] and comparing the power of different kinds of matroid oracles.[9]

Since that time, the independence oracle has become standard for most research on matroid algorithms.[10] There has also been continued research on lower bounds,[11] and comparisons of different types of oracle.[12]

The following types of matroid oracles have been considered.

• An independence oracle takes as its input a set of matroid elements, and returns as output a Boolean value, true if the given set is independent and false otherwise.[13] It may be implemented easily based on the underlying structure from which the matroid was defined for graphic matroids, transversal matroids, gammoids, and linear matroids, and for matroids formed from these by standard operations such as direct sums.[3]
• The oracle from Edmonds (1965) takes as input an independent set and an additional element, and either determines that their union is independent or finds a circuit in the union and returns it.
• A rank oracle takes as its input a set of matroid elements, and returns as its output a numerical value, the rank of the given set.[9]
• A basis oracle takes as its input a set of matroid elements, and returns as output a Boolean value, true if the given set is a basis and false otherwise.[9]
• A circuit oracle takes as its input a set of matroid elements, and returns as output a Boolean value, true if the given set is a circuit and false otherwise.[9]
• Three types of closure oracle have been considered: one that tests if a given element belongs to the closure of a given set, a second one that returns the closure of the set, and a third one that tests whether a given set is closed.[9]
• A spanning oracle takes as its input a set of matroid elements, and returns as output a Boolean value, true if the given set is spanning (i.e. contains a basis and has the same rank as the whole matroid) and false otherwise.[14]
• A girth oracle takes as its input a set of matroid elements, and returns as its output a numerical value, the size of the smallest circuit within that set (or ${\displaystyle \scriptstyle +\infty }$ if the given set is independent).[14]
• A port oracle for a fixed element ${\displaystyle \scriptstyle x}$ of the matroid takes as its input a set of matroid elements, and returns as output a Boolean value, true if the given set contains a circuit that includes ${\displaystyle \scriptstyle x}$ and false otherwise.[15]

Although there are many known types of oracles, the choice of which to use can be simplified, because many of them are equivalent in computational power. An oracle ${\displaystyle \scriptstyle X}$ is said to be polynomially reducible to another oracle ${\displaystyle \scriptstyle Y}$ if any call to ${\displaystyle \scriptstyle X}$ may be simulated by an algorithm that accesses the matroid using only oracle ${\displaystyle \scriptstyle Y}$ and takes polynomial time as measured in terms of the number of elements of the matroid; in complexity-theoretic terms, this is a Turing reduction. Two oracles are said to be polynomially equivalent if they are polynomially reducible to each other. If ${\displaystyle \scriptstyle X}$ and ${\displaystyle \scriptstyle Y}$ are polynomially equivalent, then every result that proves the existence or nonexistence of a polynomial time algorithm for a matroid problem using oracle ${\displaystyle \scriptstyle X}$ also proves the same thing for oracle ${\displaystyle \scriptstyle Y}$.

For instance, the independence oracle is polynomially equivalent to the circuit-finding oracle of Edmonds (1965). If a circuit-finding oracle is available, a set may be tested for independence using at most ${\displaystyle \scriptstyle n}$ calls to the oracle by starting from an empty set, adding elements of the given set one element at a time, and using the circuit-finding oracle to test whether each addition preserves the independence of the set that has been constructed so far. In the other direction, if an independence oracle is available, the circuit in a set ${\displaystyle \scriptstyle I\cup \{x\}}$ may be found using at most ${\displaystyle \scriptstyle n}$ calls to the oracle by testing, for each element ${\displaystyle \scriptstyle y\in I}$, whether ${\displaystyle \scriptstyle I\setminus \{y\}\cup \{x\}}$ is independent and returning the elements for which the answer is no. The independence oracle is also polynomially equivalent to the rank oracle, the spanning oracle, the first two types of closure oracle, and the port oracle.[1]

The basis oracle, the circuit oracle, and the oracle that tests whether a given set is closed are all weaker than the independence oracle: they can be simulated in polynomial time by an algorithm that accesses the matroid using an independence oracle, but not vice versa. Additionally, none of these three oracles can simulate each other within polynomial time. The girth oracle is stronger than the independence oracle, in the same sense.[9]

As well as polynomial time Turing reductions, other types of reducibility have been considered as well. In particular, Karp, Upfal & Wigderson (1988) showed that, in parallel algorithms, the rank and independence oracles are significantly different in computational power. The rank oracle allows the construction of a minimum weight basis by ${\displaystyle \scriptstyle n}$ simultaneous queries, of the prefixes of the sorted order of the matroid elements: an element belongs to the optimal basis if and only if the rank of its prefix differs from the rank of the previous prefix. In contrast, finding a minimum basis with an independence oracle is much slower: it can be solved deterministically in ${\displaystyle \scriptstyle O({\sqrt {n}})}$ time steps, and there is a lower bound of ${\displaystyle \scriptstyle \Omega ((n/\log n)^{1/3})}$ even for randomized parallel algorithms.

Many problems on matroids are known to be solvable in polynomial time, by algorithms that access the matroid only through an independence oracle or another oracle of equivalent power, without need of any additional assumptions about what kind of matroid has been given to them. These polynomially-solvable problems include:

• Finding a minimum or maximum weight basis of a weighted matroid, using a greedy algorithm.[2]
• Partitioning the elements of a matroid into a minimum number of independent sets, and finding the largest set that is simultaneously independent in two given matroids. The latter problem is called matroid intersection, and the solutions to both problems are closely related to each other.[16]
• Testing whether a matroid is ${\displaystyle \scriptstyle k}$-connected (in the sense of Tutte 1966) for ${\displaystyle \scriptstyle k\leq 3}$.[17]
• Testing whether a given matroid is graphic[18] or regular.[19]
• Finding an ear decomposition of a given matroid, a sequence of circuits whose union is the matroid and in which each circuit remains a circuit after all previous circuits in the sequence are contracted. Such a decomposition may also be found with the additional property that a chosen matroid element belongs to every circuit.[15]
• Finding a branch-decomposition of a given matroid, whenever its branch-width is no more than a fixed constant.[20]
• Listing all of the bases, flats, or circuits of a matroid, in polynomial time per output set.[21]
• Approximating the number of bases by a fully polynomial-time randomized approximation scheme, for a matroid with ${\displaystyle \scriptstyle n}$ elements and rank ${\displaystyle \scriptstyle r}$, with the additional assumption that the number of bases is within a polynomial factor of the number of ${\displaystyle \scriptstyle r}$-element sets.[22]

For many matroid problems, it is possible to show that an independence oracle does not provide enough power to allow the problem to be solved in polynomial time. The main idea of these proofs is to find two matroids ${\displaystyle \scriptstyle M}$ and ${\displaystyle \scriptstyle M'}$ on which the answer to the problem differs and which are difficult for an algorithm to tell apart. In particular, if ${\displaystyle \scriptstyle M}$ has a high degree of symmetry, and differs from ${\displaystyle \scriptstyle M'}$ only in the answers to a small number of queries, then it may take a very large number of queries for an algorithm to be sure of distinguishing an input of type ${\displaystyle \scriptstyle M}$ from an input formed by using one of the symmetries of ${\displaystyle \scriptstyle M}$ to permute ${\displaystyle \scriptstyle M'}$.[3]

A simple example of this approach can be used to show that it is difficult to test whether a matroid is uniform. For simplicity of exposition, let ${\displaystyle \scriptstyle n}$ be even, let ${\displaystyle \scriptstyle M}$ be the uniform matroid ${\displaystyle \scriptstyle U{}_{n}^{n/2}}$, and let ${\displaystyle \scriptstyle M'}$ be a matroid formed from ${\displaystyle \scriptstyle M}$ by making a single one of the ${\displaystyle \scriptstyle n/2}$-element basis sets of ${\displaystyle \scriptstyle M}$ dependent instead of independent. In order for an algorithm to correctly test whether its input is uniform, it must be able to distinguish ${\displaystyle \scriptstyle M}$ from every possible permutation of ${\displaystyle \scriptstyle M'}$. But in order for a deterministic algorithm to do so, it must test every one of the ${\displaystyle \scriptstyle n/2}$-element subsets of the elements: if it missed one set, it could be fooled by an oracle that chose that same set as the one to make dependent. Therefore, testing for whether a matroid is uniform may require

${\displaystyle {\binom {n}{n/2}}=\Omega \left({\frac {2^{n}}{\sqrt {n}}}\right)}$

independence queries, much higher than polynomial. Even a randomized algorithm must make nearly as many queries in order to be confident of distinguishing these two matroids.[23]

Jensen & Korte (1982) formalize this approach by proving that, whenever there exist two matroids ${\displaystyle \scriptstyle M}$ and ${\displaystyle \scriptstyle M'}$ on the same set of elements but with differing problem answers, an algorithm that correctly solves the given problem on those elements must use at least

${\displaystyle {\frac {|\operatorname {aut} (M)|}{\sum _{i}|\operatorname {fix} (M,Q_{i})|}}}$

queries, where ${\displaystyle \scriptstyle \operatorname {aut} (M)}$ denotes the automorphism group of ${\displaystyle \scriptstyle M}$, ${\displaystyle \scriptstyle Q_{i}}$ denotes the family of sets whose independence differs from ${\displaystyle \scriptstyle M}$ to ${\displaystyle \scriptstyle M'}$, and ${\displaystyle \scriptstyle \operatorname {fix} (M,Q_{i})}$ denotes the subgroup of automorphisms that maps ${\displaystyle \scriptstyle Q_{i}}$ to itself. For instance, the automorphism group of the uniform matroid is just the symmetric group, with size ${\displaystyle \scriptstyle n!}$, and in the problem of testing uniform matroids there was only one set ${\displaystyle \scriptstyle Q_{i}}$ with ${\displaystyle \scriptstyle |\operatorname {fix} (M,Q_{i})|=(n/2)!^{2}}$, smaller by an exponential factor than ${\displaystyle \scriptstyle n!}$.[24]

Problems that have been proven to be impossible for a matroid oracle algorithm to compute in polynomial time include:

• Testing whether a given matroid is uniform.[23]
• Testing whether a given matroid contains a fixed matroid ${\displaystyle \scriptstyle H}$ as a minor, except in the special cases that ${\displaystyle \scriptstyle H}$ is uniform with rank or corank at most one. More generally, if ${\displaystyle \scriptstyle {\mathcal {H}}}$ is a fixed finite set of matroids, and there is no uniform matroid in ${\displaystyle \scriptstyle {\mathcal {H}}}$, then it is not possible to test in polynomial time whether a given matroid contains one or more of the matroids in ${\displaystyle \scriptstyle {\mathcal {H}}}$ as a minor.[25]
• Testing whether a given matroid is binary, is representable over any particular fixed field, or whether there exists a field over which it is representable.[26]
• Solving the matroid matching problem, in which the input is a graph and a matroid on its vertices, and the goal is to find a matching in the graph that is as large as possible, subject to the constraint that the matched vertices form an independent set.[27]
• Testing whether a given matroid is self-dual, transversal, bipartite, Eulerian, or orientable.[3]
• Computing the girth (size of the smallest circuit), size of the largest circuit, number of circuits, number of bases, number of flats, number of maximum-rank flats, size of the largest flat, Tutte polynomial, or connectivity of a given matroid.[3]

Among the set of all properties of ${\displaystyle \scriptstyle n}$-element matroids, the fraction of the properties that do not require exponential time to test goes to zero, in the limit, as ${\displaystyle \scriptstyle n}$ goes to infinity.[6]

• Black box group, an oracle-like model for group theory
• Implicit graph, an oracle-like model for graph algorithms