R. Pendavingh

activity

20082026

most citedConfinement of matroid representations to subsets of partial fields

38 citations · 128 across the 24 of their papers we have counts for

collaborators

Showing 2012Show all

3 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…

math.CO2012

On the evaluation at (-i,i) of the Tutte polynomial of a binary matroid

Rudi Pendavingh

Vertigan has shown that if $M$ is a binary matroid, then $∣ T_{M} (- ι, ι) ∣$ , the modulus of the Tutte polynomial of $M$ as evaluated in $(- ι, ι)$ , can be expressed in terms of the bicyc…