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

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

Return the roots of the tree of possible Galois groups.

<p><p>

<h3>
Syntax:
</h3>
<pre>L := GaloisTreeRoots(o);</pre>

<p>

<table>
<tr>
<td>order</td>
<td><pre>  o  </pre></td>
<td></td>
</tr>
<tr>
<td>list</td>
<td><pre>  L  </pre></td>
<td>list of two lists of integers</td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#GaloisTree">GaloisTree</a>, <a href="kashref.html#Galois">Galois</a>, <a href="kashref.html#GaloisGroupsPossible">GaloisGroupsPossible</a>, <a href="kashref.html#GaloisNumberToName">GaloisNumberToName</a>

<p>

<h3>
Description:
</h3>
This function returns a list with two entries which contain the
roots of the tree of odd respectively even transitive
groups. The groups are given by their number in T-notation.

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>

<pre>

kash> o := Order(Z, 8, 2);
Generating polynomial: x^8 - 2

kash> GaloisTreeRoots(o);
[ [ 50 ], [ 49 ] ]
kash> GaloisGroupsPossible(o, [49, 50], false);
kash> GaloisTreeRoots(o);
> [ [ 47, 44, 43 ], [ 45, 39, 48 ] ]

</pre>

<p>


<hr>

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