#19172: More capable method `valuation` for polynomials
-----------------------------------+--------------------------------
Reporter: bruno | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.9
Component: commutative algebra | Keywords:
Merged in: | Authors: Bruno Grenet
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies: #19171
Stopgaps: |
-----------------------------------+--------------------------------
This ticket aims at improving the method `valuation` for polynomials in
two ways:
1. The method `valuation` for dense polynomials can be called in the
following ways:
* Without argument, return the largest power of the variable that
divides the input polynomial.
* With a polynomial (with the same parent) as argument, return the
largest power of this polynomial which divides the input polynomial.
I propose to allow another possible argument: If the argument is an
element of the base ring of the parent, it returns the minimum of the
valuations of the arguments. This is consistent with PARI.
2. The method `valuation` for sparse polynomials is much less capable than
the method for dense polynomials. I propose to have the same behaviors in
both cases.
--
Ticket URL: <http://trac.sagemath.org/ticket/19172>
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.
