An improved algorithm for recognizing matroids

Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the bases polytope. In this paper, we give a new axiom system for matroids based on locked subsets. We deduce an algorithm for recognizing matroids improving the running time complexity of the best known till today. This algorithm induces a polynomial time algorithm for recognizing uniform matroids. This latter problem is intractable if we use an independence oracle.