Let us imagine a person reading
http://www.sagemath.org/doc/reference/combinat/sage/combinat/posets/posets.html
It starts saying "implements finite partially ordered sets", so there is
no support for infinite posets.
This page tells a reader about has_bottom() and has_top(), and there is
also is_bounded() already. But for is_join_semilattice() ja
is_meet_semilattice() there is no is_lattice().
Well, there is. It is here:
http://www.sagemath.org/doc/reference/categories/sage/categories/finite_posets.html
So, why is part of code in categories/*.py?
Then, how about is_distributive_lattice()? There it is:
http://www.sagemath.org/doc/reference/combinat/sage/combinat/posets/hasse_diagram.html
But how to call it?
And last, why is there antichains() documented in two places,
/combinat/posets/posets and /categories/finite_posets?
Confused am I.
--
Jori Mäntysalo
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
