An entropy argument for counting matroids

Abstract

We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on n elements.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…