*
https://github.com/sagemath/sage/pull/39382
On Tuesday, February 11, 2025 at 2:06:03 PM UTC gmou3 wrote:
> Hi Xie,
>
> Thank you for noting this issue! Please check the newly merged changes
> where it has been corrected: https://github.com/sagemath/sage/pull/36962
>
> I hadn't yet added the ma
Hi Xie,
Thank you for noting this issue! Please check the newly merged changes
where it has been corrected: https://github.com/sagemath/sage/pull/36962
I hadn't yet added the matroid-database package (and the AllMatroids
method) back then.
On Monday, January 27, 2025 at 11:28:12 AM UTC Xie wro
Thank you. A matroid is sparse paving if both the matroid itself and its
dual are paving. This criterion can be used to count the number of sparse
paving matroids, assuming the .is_paving() method is correct. Sparse paving
matroids have several definitions, but as far as I know, their definiti
On Sat, Jan 25, 2025 at 11:03 PM Xie wrote:
>
> 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_r
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
spar
