An entropy argument for counting matroids
classification
🧮 math.CO
cs.ITmath.IT
keywords
matroidsalmostapplicationargumentboundcountingdirectelements
read the original abstract
We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on $n$ elements.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.