for M in matroids.AllMatroids(8, type='sparse_paving'): ....: print(M) sparse_paving_n08_r04_#0: Matroid of rank 4 on 8 elements with 56 bases sparse_paving_n08_r05_#0: Matroid of rank 5 on 8 elements with 48 bases sparse_paving_n08_r06_#0: Matroid of rank 6 on 8 elements with 24 bases sparse_paving_n08_r07_#0: Matroid of rank 7 on 8 elements with 8 bases sparse_paving_n08_r07_#1: Matroid of rank 7 on 8 elements with 7 bases sparse_paving_n08_r08_#0: Matroid of rank 8 on 8 elements with 1 bases
This can't be correct because almost all matroids are sparse paving. In SageMath, the is_sparse_pavingās Docstring defines: *"Return if 'self' is sparse-paving. A matroid is sparse-paving if the symmetric difference of every pair of circuits is greater than 2."* I believe this is incorrect! -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To view this discussion visit https://groups.google.com/d/msgid/sage-support/a0f42d8e-a377-465e-b224-04166d86bc80n%40googlegroups.com.