A method to construct all the paving matroids over a finite set
Por:
Mederos B., Pérez-Cabrera I., Takane M., Tapia Sánchez G., Zavala B.
Publicada:
1 ene 2022
Categoría:
Mathematics (miscellaneous)
Resumen:
We give a characterization of paving matroids through their sets of hyperplanes and an algorithm to construct all of them. We also give a simple proof of Rota’s basis conjecture for the case of sparse-paving matroids and for the case of paving matroids of rank r on a set of cardinality n=2r, and a counterexample to Oxley’s characterization of paving matroids. © 2022, Sociedad Matemática Mexicana.
Filiaciones:
Mederos B.:
Departamento de Física y Matemáticas, Universidad Autónoma de Ciudad Juárez, Ciudad Juárez, Mexico
Pérez-Cabrera I.:
Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic
Takane M.:
Instituto de Matemáticas, Universidad Nacional Autónoma de México (UNAM), México City, Mexico
Tapia Sánchez G.:
Departamento de Física y Matemáticas, Universidad Autónoma de Ciudad Juárez, Ciudad Juárez, Mexico
Zavala B.:
Facultad de Ciencias, Universidad Autónoma del Estado de México, Toluca, Mexico
Green Submitted
|