2 problems

Let $M$ range over matroids on an $n$-element ground set, with $n$ tending to infinity. A paving matroid is a matroid whose circuits have size $r$ or $r+1$, where $r$ is its rank;…

For each positive integer $n$, let $\operatorname{sp}(n)$ and $\operatorname{es}(n)$ denote the numbers of sparse paving and elementary split matroids on $[n]$. Let…