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

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

Returns the smith normal form of a group.

<p><p>

<h3>
Syntax:
</h3>
<pre>s := AbelianGroupSmithCreate(g [, generators]);</pre>

<p>

<table>
<tr>
<td>group</td>
<td><pre>  g, s  </pre></td>
<td></td>
</tr>
<tr>
<td>boolean</td>
<td><pre>  generators  </pre></td>
<td></td>
</tr>
</table>

<p>


<h3>
Description:
</h3>
Returns the smith normal form s of g: the relation matrix
of s is in smith normal form. The groups s and g are
isomorphic. If the second (optional)
parameter <tt>generators</tt> is <tt>true</tt> then the new
generators are computed, too.
This is useful if you often use the discrete exp.

<p><p>

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

<pre>

kash> g := AbelianGroupCreate([[15,5,-5,10],[0,0,0,50],[6,6,6,6]]);
Group with relations:
[15  5 -5 10]
[ 0  0  0 50]
[ 6  6  6  6]
kash> s := AbelianGroupSmithCreate(g);
> Group with relations:
[ 10   0   0]
[  0 300   0]
[  0   0   0]

</pre>

<p>


<hr>

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