#18987: Parallel computation for TilingSolver.number_of_solutions
-------------------------+-------------------------------------------------
Reporter: | Owner:
slabbe | Status: needs_review
Type: | Milestone: sage-6.9
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers: Vincent Delecroix
combinatorics | Work issues:
Keywords: | Commit:
Authors: | 0c752d4038a7419285a1c1fa9b0c21842b593a2e
Sébastien Labbé | Stopgaps:
Report Upstream: N/A |
Branch: |
public/18987 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by slabbe):
> So the quotient is just the signed permutation matrices with either `0`
or `1` coefficient `-1` (all others being `1`). Isn't it?
When `orientation_preserving=True`, the determinant of every returned
matrix must be one. Therefore, I believe the quotient is the positive
permutation matrices of determinant one + the other permutation matrices
where one 1 is replaced by -1.
--
Ticket URL: <http://trac.sagemath.org/ticket/18987#comment:30>
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.
