N. Bansal

activity

20072026

most citedConstructive Algorithms for Discrepancy Minimization

38 citations · 157 across the 44 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

math.CO2012★ 3 cited

An entropy argument for counting matroids

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

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

math.CO2012

On the number of matroids

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

We consider the problem of determining $m_{n}$ , the number of matroids on $n$ elements. The best known lower bound on $m_{n}$ is due to Knuth (1974) who showed that $lo g lo g m_{n}$ is…