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

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

Output of possible Galois groups as subgroup lattice.

<p><p>

<h3>
Syntax:
</h3>
<pre>L := GaloisTree(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#Galois">Galois</a>, <a href="kashref.html#GaloisTreeRoots">GaloisTreeRoots</a>, <a href="kashref.html#GaloisGroupsPossible">GaloisGroupsPossible</a>, <a href="kashref.html#GaloisNumberToName">GaloisNumberToName</a>

<p>

<h3>
Description:
</h3>
This function prints the subgroup lattice of possible
Galois groups as non-connected and directed tree and
returns a list with two entries which contain the
roots of the tree of odd respectively even transitive
groups.

<p><p>

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

<pre>

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

kash> GaloisTree(o);
> ******* tree of possible groups *******

rootSn:
16: 13 11 14 
13: 9 
9: 5 3 
5: 2 1 
2: 
1: 
3: 2 1 
11: 8 6 3 
8: 2 
6: 1 
14: 

rootAn:
15: 10 7 12 
10: 
7: 4 
4: 
12: 

***************************************
[ [ 16 ], [ 15 ] ]

</pre>

<p>


<hr>

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