#19659: Poset: inverse function of ordinal_sum()
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.0
Component: combinatorics | Resolution:
Keywords: poset | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/develop | 4358a5a4574999015ccb9088bdb842dcc738d40c
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
About the algorithm: I don't know if it makes a big difference and if
could help with your applications, but there may be something to gain by
checking the *degree* of the minimum elements before doing some operations
on the sets of neighbors themselves. Just before
{{{
#!diff
+for l in lower:
+ if self.degree_out(l) != len(upper)
+ break
for l in lower:
if set(self.neighbors_out(l)) != upper:
break
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/19659#comment:17>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
