#13742: No Permutation should be created that its method cannot handle
---------------------------------+------------------------------------------
Reporter: ncohen | Owner: sage-combinat
Type: defect | Status: needs_work
Priority: major | Milestone: sage-5.6
Component: combinatorics | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Nathann Cohen | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by dimpase):
Replying to [comment:14 dimpase]:
{{{
diff --git a/sage/graphs/comparability.pyx b/sage/graphs/comparability.pyx
--- a/sage/graphs/comparability.pyx
+++ b/sage/graphs/comparability.pyx
@@ -607,7 +607,8 @@
Plotting the realization as an intersection graph of segments::
sage: true, perm = is_permutation(g, certificate = True)
- sage: p1, p2 = map(Permutation, perm)
+ sage: p1 = Permutation([nn+1 for nn in perm[0]])
+ sage: p2 = Permutation([nn+1 for nn in perm[1]])
sage: p = p2 * p1.inverse()
sage: p.show(representation = "braid")
}}}
makes the tests pass. But probably more needs to be done...
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13742#comment:15>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
