Approximate counting of common bases of two matroids

Get email updates

OpenAI

Two finite equal-rank matroids supplied by independence oracles admit an FPRAS for their number of common bases. The algorithm returns zero when there are none and has polynomial oracle and bit bounds on every run in the encoded input, ε−1\varepsilon ^{-1} and log⁡δ−1\log \delta ^{-1}.

What was already known

The cataloged integer-polymatroid FPRAS uses rank-value oracles and covers a wider input type. This is the earlier distinct ordinary-matroid manuscript, with its own independently scoped checking evidence.

AI involvement AI-led

The manuscript credits OpenAI as author, and the pinned release attributes its manuscripts to the internal model. Individual session details are undocumented.

Importance Notable

A counting approximation scheme for unrestricted pairs supplied by independence oracles.

Technical verification Formal (Lean)

OpenAI’s selected formal theorem covers ordinary matroid common bases and the exact oracle complexity and zero-count guarantees, rather than general integer polymatroids.

Formal checking

OpenAI’s selected formal theorem covers ordinary matroid common bases and the exact oracle complexity and zero-count guarantees, rather than general integer polymatroids.

Checker
OpenAI’s reported Lean formalization
Scope
OpenAI’s selected formal theorem covers ordinary matroid common bases and the exact oracle complexity and zero-count guarantees, rather than general integer polymatroids.
Basis
Reported by the linked checker

Human understanding Few

The reviewed sources do not document a human explanation of the assessed contribution.

Correction and publication history