Yoo !
> Möbius function matrix depends on other parts. We can do a boolean matrix
> --- take GF(2) as base ring --- but is it stored as bits packed to bytes
> really?
HMmm... Actually it seems that we already have something like that:
sage.matrix.matrix_mod2_dense.pyx
But so
On Sat, 13 Dec 2014, Nathann Cohen wrote:
It is basically just self.lequal_matrix().inverse().change_ring(ZZ).
Oh. No Poset-specific algorithm. I see. Then we should earn a lot by
doing so.
But really, in the Poset class we are very very very far from having
implemented correctly all that
