An entropy argument for counting matroids
Combinatorics
2012-10-25 v1 Information Theory
math.IT
Abstract
We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on elements.
Cite
@article{arxiv.1210.6581,
title = {An entropy argument for counting matroids},
author = {N. Bansal and R. A. Pendavingh and J. G. van der Pol},
journal= {arXiv preprint arXiv:1210.6581},
year = {2012}
}
Comments
Short note, 4 pages