ScholarLens Back to search
2013•Unpublished venueRequires access

On the number of matroids

Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol

Open publisher page 7 citations

Abstract

We consider the problem of determining mn, the number of matroids on n elements. The best known lower bound on mn is due to Knuth (1974) who showed that log log mn is at least . On the other hand, Piff (1973) showed that log log mn ≤ n − log n + log log n + O(1), and it has been conjectured since that the right answer is perhaps closer to Knuth's bound. We show that this is indeed the case, and prove an upper bound on log log mn that is within an additive 1 + o(1) term of Knuth's lower bound. Our proof is based on using some structural properties of non-bases in a matroid together with some properties of independent sets in the Johnson graph to give a compressed representation of matroids.

About this research paper

What this paper is about

We consider the problem of determining mn, the number of matroids on n elements. The best known lower bound on mn is due to Knuth (1974) who showed that log log mn is at least . On the other hand, Piff (1973) showed that log log mn ≤ n − log n + log log n + O(1), and it has been conjectured since that the right answer is perhaps closer to Knuth's bound. We show that this is indeed the case, and prove an upper bound on log log mn that is within an additive 1 + o(1) term of Knuth's lower bound. Our proof is based on using some structural properties of non-bases in a matroid together with some properties of independent sets in the Johnson graph to give a compressed representation of matroids.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We consider the problem of determining mn, the number of matroids on n elements. The best known lower bound on mn is due to Knuth (1974) who showed that log log mn is at least . On the other hand, Piff (1973) showed that log log mn ≤ n − log n + log log n + O(1), and it has been conjectured since that the right answer is perhaps closer to Knuth's bound. We show that this is indeed the case, and prove an upper bound on log log mn that is within an additive 1 + o(1) term of Knuth's lower bound. Our proof is based on using some structural properties of non-bases in a matroid together with some properties of independent sets in the Johnson graph to give a compressed representation of matroids.

Key concepts: Matroid, Combinatorics, Upper and lower bounds, Binary logarithm, Mathematics, Log-log plot, Graph, Discrete mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the number of matroids — Research Paper | ScholarLens