#19462: LinearCode.is_projective
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.10
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
coding theory | Work issues:
Keywords: | Commit:
Authors: | 017089a65dc9ef2087762007590d43cde1832240
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/19462 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by vdelecroix):
Replying to [comment:21 jsrn]:
> This is clearly not projective since 2*c1 = c2.
In the definition given in reference by Nathann, the condition is that `R
c1 != R c2`... but of course, the definition is non-ambiguous over a
field.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/19462#comment:22>
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.
