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

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

Returns generators of a group.

<p><p>

<h3>
Syntax:
</h3>
<pre>L := AbelianGroupGenerators(g [, exp]);</pre>

<p>

<table>
<tr>
<td>group</td>
<td><pre>  g  </pre></td>
<td></td>
</tr>
<tr>
<td>list</td>
<td><pre>  L  </pre></td>
<td>list of generators of g</td>
</tr>
<tr>
<td>boolean</td>
<td><pre>  exp  </pre></td>
<td></td>
</tr>
</table>

<p>


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

<p>

<h3>
Description:
</h3>
Returns a list of generators of the group g. If the second
(optional) parameter exp is <tt>true</tt> then the discrete exp is
applied.


<p><p>

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

<pre>

kash> O := OrderMaximal(Z, 2, 10);
Generating polynomial: x^2 - 10
Discriminant: 40 

kash> g := RayClassGroupToAbelianGroup(3*O, [1, 2]);
RayClassGroupToAbelianGroup(<3>, [ 1, 2 ])
Group with relations:
[4 0]
[0 2]
kash> l := AbelianGroupGenerators(g);
[ [1 0], [0 1] ]
kash> l := AbelianGroupGenerators(g, true);
> [ <2, [0, 1]>, <[1, -3]> ]

</pre>

<p>


<hr>

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