[back] [prev] [next] [index] [root]

<p>&nbsp;<p>
<hr noshade size="5">
<h2><a name="PolyMove"></a>
PolyMove
</h2>

Tries to compute a representation of a polynomial in a different
polynomial algebra.

<p><p>

<h3>
Syntax:
</h3>
<pre>g := PolyMove (f, S);</pre>

<p>

<table>
<tr>
<td>polynomial</td>
<td><pre>  g  </pre></td>
<td></td>
</tr>
<tr>
<td>polynomial</td>
<td><pre>  f  </pre></td>
<td></td>
</tr>
<tr>
<td>ring</td>
<td><pre>  S  </pre></td>
<td></td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#PolyAlg">PolyAlg</a>

<p>

<h3>
Description:
</h3>
Given a polynomial and a polynomial algebra or a ring, this
function computes a representation of the polynomial either
in the given polynomial algebra or in the polynomial algebra
associated to the ring. In case only a ring is given, the
function automatically generates the polynomial algebra, which
is then accessible by the function call PolyAlg (g).

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>
We will factor a polynomial over its equation order. 
<pre>

kash> o := Order(Z, 4, 5);;
kash> ox := PolyAlg(o);;
kash> f := PolyMove(OrderPoly(Zx, o), ox);
x^4 - 5
kash> Factor(f);
> [ [ x + [0, -1, 0, 0], 1 ], [ x + [0, 1, 0, 0], 1 ], 
  [ x^2 + [0, 0, 1, 0], 1 ] ]

</pre>

<p>


<hr>

<p>
<a href="../kashref.html"><- back</a>[back] [prev] [next] [index] [root]