PolynomialTools[Shorten] - try to make polynomial smaller by substitutions
PolynomialTools[Shorter] - compare two polynomials
PolynomialTools[Sort] - sort a list of polynomials
|
Calling Sequence
|
|
Shorter(f, g, x)
Sort(v, x)
Shorten(f, x)
|
|
Parameters
|
|
f
|
-
|
polynomial
|
g
|
-
|
polynomial
|
v
|
-
|
list of polynomials
|
x
|
-
|
indeterminate
|
|
|
|
|
Description
|
|
•
|
The Shorter function determines if f is shorter than g, where "shorter" means:
|
|
lower degree in other variables
|
•
|
The Sort function sorts a list of polynomials in x according to the ordering defined by Shorter.
|
•
|
The Shorten function applies Mobius transformations to f in an effort to make f shorter (in the above sense). More precisely, the following transformations are tried: whenever has([a, b, c, d], x)=false and . Furthermore, a polynomial f may be divided by lcoeff(f, x) or by content(f, x), or by any expression that does not contain x.
|
•
|
When a field extension is given by an irreducible polynomial f, these procedures can be used to search for a simpler polynomial representing the same field extension.
|
•
|
If f contains only one variable, then the second argument x in Shorten is optional.
|
•
|
This function is part of the PolynomialTools package, and so it can be used in the form Shorten(..) only after executing the command with(PolynomialTools). However, it can always be accessed through the long form of the command by using PolynomialTools[Shorten](..).
|
|
|
Examples
|
|
>
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
>
|
|
| (5) |
|
|
Download Help Document
Was this information helpful?