On Thu, Mar 12, 2015 at 02:00:37AM -0700, Nathann Cohen wrote:
> As Sage is open-source you can usually answer such questions by reading
> the code, or the function's documentation.
> In this specific case, however, I do not know if we actually have this
> feature in Sage: do you *know* how to enumerate meet-semilattices in
> Sage? If so please share the commands, and we will probably find in the
> doc a description of the algorithm it implements.
As far as I know, it is not implemented. There is a tiny note about
this at the end of:
sage.combinat.tutorial?
In theory it should be possible to use the tool ``graphs`` to generate
graphs up to an isomorphism, using an orderly generation along the
vertices. However, when we tried this with Tom Denton a couple years
ago, we stumbled on an issue. I can try to recover the details; it was
something about making sure that the new vertices were added to the
top of the meet semi lattice, which required a minimum of control on
the canonical labeling.
Cheers,
Nicolas
--
Nicolas M. Thiéry "Isil" <nthi...@users.sf.net>
http://Nicolas.Thiery.name/
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-combinat-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-combinat-devel.
For more options, visit https://groups.google.com/d/optout.
