A Method to construct all the Paving Matroids over a Finite Set
We give a characterization of a matroid to be paving, through its set of hyperplanes and give an algorithm to construct all of them.
math.CO↗
arXiv subjects
B. Zavala
Publications and source records attributed to B. Zavala.
A Method to construct the Sparse-paving Matroids over a Finite Set
In this work we present an algorithm to construct sparse-paving matroids over finite set $S$. From this algorithm we derive some useful bounds on the cardinality of the set of circuits of any Sparse-Paving matroids which allow us to prove in a simple way an asymptotic relation between the class of Sparse-paving matroids and the whole class of matroids. Additionally we introduce a matrix based method which render an explicit partition of the $r$-subsets of $S$, $\binom{S}{r}=\sqcup_{i=1}^{γ}\mathcal{U}_{i}$ such that each $\mathcal{U}_{i}$ defines a sparse-paving matroid of rank $r$.
math.CO↗