#17053: Add function for direct sum of posets
---------------------------------+-----------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-wishlist
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------+-----------------------------
Comment (by jmantysalo):
Replying to [comment:3 ncohen]:
> Then, if you want to have more ways to tune the result through the
points' name, the best would be to change the Graph function itself, which
would consequently give the same feature to the Poset function.
True. I must learn functions provided by (di)graphs and expand them if
necessary.
> We already have a `Graph.disjoint_union` that accepts this kind of
parameter. If you want to have a similar feature at `Poset` level I
suggest that you only expose this function. The code would just be :
> {{{
> return Poset(self.hasse_diagram().disjoint_union(other.hasse_diagram()))
> }}}
This breaks at least with
{{{
P1=Posets.PentagonPoset(facade=True)
P1=Posets.PentagonPoset(facade=False)
P=Poset(P1.hasse_diagram().disjoint_union(P2.hasse_diagram()))
P.show()
}}}
But I'll add checks as necessary. I guess it is OK to simply refuce
summing up facade and non-facade poset.
--
Ticket URL: <http://trac.sagemath.org/ticket/17053#comment:4>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" 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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
