Oct 24, 2012 · Abstract:We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on n elements.
Abstract. We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on n elements.
PDF | We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on $n$ elements.
We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on $n$ elements.
We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on n elements.
Apr 19, 2016 · In this blog post, we show how entropy can be used for counting problems in general and for counting matroids in particular, and we give a new ...
Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol: An entropy argument for counting matroids. J. Comb. Theory B 109: 258-262 (2014). manage site settings.
Abstract. We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on n elements.
The set of all maximal independent sets in a matroid is called the bases of the matroid and is denoted by BM . An example of a matroid is the graphic matroid.
Missing: argument | Show results with:argument
Fingerprint. Dive into the research topics of 'An entropy argument for counting matroids'. Together they form a unique fingerprint.