I want to check a graph theoretic conjecture appeared during an applied software research.
I am going to conduct a numeric experiment involving three posets of the size N (for small N). (I hope N=4 or 5 will suffice, but it is entirely unknown for me.) I can take one of the three up-to-isomorphism, but the other two cannot be taken up-to-isomorphism, because this way its relations with the other two posets would be "erased". So I have three posets: one up-to-isomorphism and the other two not up- to-isomorphism. To my frustration I found that we have sage.combinat.posets.posets.FinitePosets_n(n) but not sage.combinat.posets.posets.FinitePosets(n). So I have no tool to enumerate not up-to-isomorphism :-( Could you help me to solve this problem? I am not strong in graph theory. If somebody provides an algorithm to enumerate all posets on a set, this may help considerably. Another issue: I need only posets greater than a certain fixed poset (one of the three posets mentioned above, actually). Filtering out posets which are not greater than the given one would rule out many variants and speed up the search. So I wish that they would be ruled out on the stage of enumeration, rather than enumerating all of them and filtering out these which are not greater than it. By the way, can anyone give me CPU power of a supercomputer for free? My problem may be important for development of XML technologies in the World. Don't hesitate to write me. Well, my actual problem: https://math.stackexchange.com/q/2601651/4876 -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
