An entropy argument for counting matroids

N. Bansal; R.A. Pendavingh; J.G. Pol, van der

doi:10.1016/j.jctb.2014.06.001

An entropy argument for counting matroids

N. Bansal
, R.A. Pendavingh
, J.G. Pol, van der

Research output: Contribution to journal › Article › Academic › peer-review

3 Citations (Scopus)

7 Downloads (Pure)

Abstract

We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on n elements. Keywords: Matroids; Enumeration; Entropy; Shearer's Lemma

Original language	English
Pages (from-to)	258-262
Number of pages	5
Journal	Journal of Combinatorial Theory, Series B
Volume	109
DOIs	https://doi.org/10.1016/j.jctb.2014.06.001
Publication status	Published - 2014

Access to Document

10.1016/j.jctb.2014.06.001

Cite this

@article{977b2295f1fe43489b060bdc0ab54821,

title = "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. Keywords: Matroids; Enumeration; Entropy; Shearer's Lemma",

author = "N. Bansal and R.A. Pendavingh and \{Pol, van der\}, J.G.",

year = "2014",

doi = "10.1016/j.jctb.2014.06.001",

language = "English",

volume = "109",

pages = "258--262",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - An entropy argument for counting matroids

AU - Bansal, N.

AU - Pendavingh, R.A.

AU - Pol, van der, J.G.

PY - 2014

Y1 - 2014

N2 - We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on n elements. Keywords: Matroids; Enumeration; Entropy; Shearer's Lemma

AB - We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on n elements. Keywords: Matroids; Enumeration; Entropy; Shearer's Lemma

U2 - 10.1016/j.jctb.2014.06.001

DO - 10.1016/j.jctb.2014.06.001

M3 - Article

SN - 0095-8956

VL - 109

SP - 258

EP - 262

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

ER -

An entropy argument for counting matroids

Abstract

Access to Document

Fingerprint

Cite this