#16892: Function to check if a poset containt a subposet isomorphic to another
poset
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-wishlist
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/function_to_check_if_a_poset_containt_a_subposet_isomorphic_to_another_poset|
160d8a5cdd251d13619e1291542cdd35a3f57ba2
Dependencies: 16909 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello !
> Is every possible object that can be an element of a poset comparable?
If so, maybe is there some way to remove duplicates by order: Remove
subset 0,2,1 and let 0,1,2 be? But this must be think more.
No, you cannot assume that. The points of a poset may be sets themselves,
and their order with respect to `<=` is not a total order.
> If it is not possible, should there be function giving also duplicates,
with warning section saying something about that?
This is the way it is done in `Graph.subgraph_search_iterator`.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16892#comment:28>
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.
