Opened 12 years ago

Last modified 7 years ago

#5590 new enhancement

coercion between polynomial rings over extension fields and polynomial rings over the prime subfield

Reported by: malb Owned by: malb
Priority: major Milestone: sage-6.4
Component: commutative algebra Keywords: coercion, polynomial ring
Cc: was Merged in:
Authors: Reviewers:
Report Upstream: Work issues:
Branch: Commit:
Dependencies: Stopgaps:

Status badges

Description

At #5569 William wrote:

As a challenge to Martin -- can you improve Sage so this decimal string conversion (which could be a killer show stopper if the ideal had huge elements) isn't needed, and instead one can use a homomorphism?

The situation William is talking about is this: 

sage: K.<a> = GF(2^3)
sage: P.<x,y> = PolynomialRing(K)
sage: R = PolynomialRing(GF(2),3,'a,x,y')

and we are looking for a way to convert elements in P to elements in R.

Change History (4)

comment:1 Changed 8 years ago by jdemeyer

  • Milestone changed from sage-5.11 to sage-5.12

comment:2 Changed 7 years ago by vbraun_spam

  • Milestone changed from sage-6.1 to sage-6.2

comment:3 Changed 7 years ago by vbraun_spam

  • Milestone changed from sage-6.2 to sage-6.3

comment:4 Changed 7 years ago by vbraun_spam

  • Milestone changed from sage-6.3 to sage-6.4
Note: See TracTickets for help on using tickets.