#5484: improve quotients of univariate polynomial rings
-------------------------------------+-------------------------------------
Reporter: AlexGhitza | Owner: malb
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.4
Component: commutative | Resolution:
algebra | Merged in:
Keywords: | Reviewers:
Authors: Bruno Grenet | Work issues:
Report Upstream: N/A | Commit:
Branch: | 503db3c5580fa7e9f5e5ab2ae6d50a68d16ca580
u/bruno/quotient_rings_univariate | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by {'newvalue': u'Bruno Grenet', 'oldvalue': ''}):
* status: new => needs_review
* commit: => 503db3c5580fa7e9f5e5ab2ae6d50a68d16ca580
* author: => Bruno Grenet
* upstream: => N/A
Comment:
I made the following proposition:
Suppose that `R = PolynomialRing(S,'x')` for some ring `S`, and `f` is a
polynomial over `S`.
* Keep the same thing if `f` has degree `> 0` or `f` is a unit, that is
return `PolynomialQuotientRing(S, f, 'x')`;
* Return `PolynomialRing(S.quo(f), 'x')` when `f` is a non-unit constant.
In particular:
{{{
sage: R = ZZ['x']
sage: R.quo(2)
Univariate Polynomial Ring in x over Ring of integers modulo 2 (using NTL)
}}}
Does this make sense?
----
New commits:
||[http://git.sagemath.org/sage.git/commit/?id=503db3c5580fa7e9f5e5ab2ae6d50a68d16ca580
503db3c]||{{{Add specific code for quotient by polynomials of degree
0}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/5484#comment:7>
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.
