A Method to construct all the Paving Matroids over a Finite Set

B. Mederos; I. Pérez-Cabrera; M. Takane; G. Tapia-Sánchez; B. Zavala

doi:10.1007/s40590-022-00440-9

A Method to construct all the Paving Matroids over a Finite Set

Combinatorics 2022-08-01 v1

Authors: B. Mederos , I. Pérez-Cabrera , M. Takane , G. Tapia-Sánchez , B. Zavala

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

We give a characterization of a matroid to be paving, through its set of hyperplanes and give an algorithm to construct all of them.

Keywords

matroid theory simplicial complexes matrix algorithms

Cite

@article{arxiv.1906.04931,
  title  = {A Method to construct all the Paving Matroids over a Finite Set},
  author = {B. Mederos and I. Pérez-Cabrera and M. Takane and G. Tapia-Sánchez and B. Zavala},
  journal= {arXiv preprint arXiv:1906.04931},
  year   = {2022}
}