Hello, 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. Nathann On Wednesday, March 11, 2015 at 11:44:07 AM UTC+1, Ercan Altınışık wrote: > > > Dear all, > > I am studying the divisibility problem of meet and join matrices which > deals with the structure of finite meet semi-lattices. I know that Sage > generates a list of Hasse diagrams meet semi-lattices with n-elements. I > wonder how to construct meet semi-lattices with n elements. > > I have Stanley's texts (EC1 and EC2) and also the following paper of > Heitzig and Reinhold. > > http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.24.2420&rep=rep1&type=pdf > > Is the method used in Sage to obtain meet semi-lattices based on checking > all possible meets in the posets with n elements? > Or are there any other method to construct them? Especially a recursive > method? > > best regards, > > Ercan Altinisik > -- 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.
